method of selecting a plurality of media items

专利摘要:
MEDIA INSERTION SYSTEM. In a replacement media system, one of a set of media items is selected on a program receiver for transmission on a predefined schedule partition, based on profile data available at the receiver. Sets of media items are programmed for partitions according to one or more limitations pertaining to that partition and/or media items programmed for other partitions. The receiver can select a media item for streaming on one partition by resolving limitations with media items programmed for other partitions, or selected for streaming on other partitions.
公开号:BR112012006884B1
申请号:R112012006884-9
申请日:2010-08-02
公开日:2021-07-06
发明作者:Christopher John Patten；Christopher David Caines；Jeffrey Russel Eales；Herve Murret-Labarthe
申请人:British Sky Broadcasting Limited；
IPC主号:

专利说明:

field of invention
The present invention relates to a program distribution system with local media insertion. Background of the invention
Media insertion systems involve selecting a media item for output by a receiver during a predefined partition in a broadcast-time program or when playing back recorded or video on demand (VOD) programming, such as from a Personal Video Recorder (PVR). Where the schedule includes content during the partition that can be replaced by media insertion, this replacement is referred to as media replacement. Such systems can be used for Targeted Replacement Advertising (TSA), where an ad (a US English commercial) is selected for delivery based on a predefined user profile, with no specific ad selection by the user. In a broadcast example, the user experience is similar to watching a broadcast with an advertising break, but the ads are tailored to the user's profile through a selection made at the broadcast receiver. A default media item can be included in the broadcast schedule during partition for broadcast by receivers on which media substitution is not enabled, or by receivers not targeted by the substitution.
Attempts have been made to standardize aspects of media insertion. For example, Society of Cable Telecommunications Engineers SCTE 130-1 2008 standard defines a framework of XML interface standards for communication between different components of a replacement advertising platform. The Advanced Advertising 1.0 specification was announced by Canoe Ventures LLV on March 30, 2009.
However, the practical implementation of a media insertion or replacement system presents many challenges. One problem is the complexity of programming media items that are subject to limitations, for example, relating to other media items to be programmed or programmed programs, particularly when broadcast close to or adjacent to each other. The limitations in current linear (ie, non-replacement) ad programming systems already involve a considerable level of complexity. For example, the applicant's Landmark 2 system requires a dedicated, state-of-the-art computer system to perform the constraint satisfaction needed to manage ad programming across more than 200 channels. Performing substitution booking in the same system context as linear booking would involve an unmanageable level of complexity if the limitations were to be met across all possible substitution options. A specific issue is the limited processing power available on the receiver to select replacement options.
In a centralized broadcast system, such as a satellite broadcast system, regional variations in media items should be handled by substitution or insertion, rather than by broadcasting regional variations only from the corresponding regional headends.
Another issue with media replacement involves determining which media items were issued in the receiver. Currently, such information is obtained from survey data from a relatively small number of users, although more accurate information can be provided via a back link. However, the receiver may not have a return link available, or it may be desirable to avoid using a return link, for example, where the return channel is through a dial-up modem connectable to the user's main telephone line. Users may also be averse to systems that report specific user behavior to a remote location.
Another problem involves the method of selecting the replacement media items to be issued by the receiver, according to the user's profile. It would be desirable for the selection criteria to be as flexible as possible, but this would involve storing a large amount of profile data in the receiver. Also, the broadcast receiver may not be able to apply complex selection rules to determine which media item to broadcast.
Another problem involves controlling the probability that a specific media item or set of media items will be issued by a specific receiver. In linear scheduling systems, predicted audience figures and profiles for a specific program are used to select which advertisements should be scheduled in an interval at or adjacent to that program. Predicted audience figures are provided in the UK by the Broadcasters’ Audience Research Board (BARB). The probability of a specific advertisement being broadcast by a specific receiver is simply determined by the probability that that receiver is tuned to the channel on which the advertisement is scheduled, during the time slice in which the advertisement is scheduled. This probability is a function of the audience segment to which the receiver belongs.
In a media substitution system, the probability of a specific replacement ad being issued by a specific receiver also depends on the probability that that replacement ad is selected by the receiver. Although predicted audience figures can be divided by audience segment, these segments may not correspond to the segments in which different replacement options are targeted. Therefore, predicted audience figures are less useful for scheduling replacement media items than for scheduling linear media items.
It would therefore be desirable to control the distribution of replacement media items so as to optimize the probability of a specific media item, addressed to a selected audience segment, being broadcast by receivers comprised in that audience segment.
Another problem that arises from inserting replacement media is the need to transition in an output stream between a repeating or broadcast program and a replacement item as seamlessly as possible. Ideally, the transition should be seamless to the user so that the user experience is indistinguishable from watching a media item, such as an advertisement, included as part of a replay or broadcast program. However, the use of digitally encoded video and audio data presents specific problems in joining a replacement media item into an output stream.
Digital video broadcasts typically comply with DVB standards such as DVB-T for terrestrial and DVB-S for satellite, which specify the use of interframe video compression such as MPEG-2. Therefore, at least some of the video frames are encoded with reference to a previous frame (P frames) or with reference to previous and subsequent frames (B frames). Splicing a video stream into another video stream can break the encoding scheme, for example, if a B-frame from one stream is followed by a P or B-frame from the other stream, such that severe decoding errors occur.
At least some of the video frames can have an associated time reference, such as the presentation timestamp (PTS) included in MPEG-2 video streams, to assist with audio synchronization. The time reference of a broadcast stream can indicate the broadcast time. However, a replacement media item will typically have an entirely different time reference from the replay or broadcast stream. When a replacement media item is merged into a broadcast stream, the resulting discontinuity in time references can cause problems with video and audio decoders, such as audio loss of synchronization or audio noise dampening.
The audio decoding of replacement content presents a specific problem since the audio decoding can be performed by an external decoder that is not aware of when merging has occurred, and is not designed to handle audio content united. Any apparent errors in the audio stream caused by splicing will lead to unpredictable results in the audio decoder.
Another problem can incur in indicating junction points to a broadcast encoder. The system upstream of the encoder indicates the junction points using a time reference, while the encoder encodes the junction point with reference to a specific video frame. Since the indicated time may not correspond precisely to the beginning of an encoded frame, there is uncertainty of up to one frame period at the encoded position of the junction point.
The above problems are not confined to broadcast systems, as video-on-demand (VOD) and push video-on-demand (PVOD) systems can include replacement content with a requested program; see, for example, applicant's patent publication WO 2008/078093 A1 regarding linking secondary items such as advertisements with a primary item such as a requested program. Declaration of Invention
According to an aspect of the present invention, there is provided a method of selecting a media item for broadcast in program partition at a program receiver, the method comprising, at the receiver, receiving an indication of possible media items for broadcast in that partition; and selecting up to one of the possible media items for issuance in the partition in accordance with one or more limitations associated with one or more media items allocated to at least one other program partition.
According to another aspect of the present invention, there is provided a method of media insertion in which programming is received by a program receiver and may be broadcast substantially immediately by the receiver and/or recorded on the receiver for subsequent broadcast, the schedule. having an interval defined therein such that media stored in the receiver can be broadcast during the interval, wherein the interval in broadcasting the recorded programming is shorter than the interval in broadcasting the programming substantially immediately.
According to another aspect of the present invention, there is provided a method of media insertion in which programming is received by a program receiver and may be broadcast substantially immediately by the receiver and/or recorded on the receiver for subsequent broadcast, the schedule. having an interval defined therein such that media stored in the receiver can be selectively broadcast during the interval, wherein the media selection options differ between the broadcast interval of the recorded programming and the broadcast interval of the program substantially immediately.
According to another aspect of the present invention, there is provided a method of outputting an audiovisual replacement media item in a media broadcast stream at a media broadcast device, wherein the media broadcast stream comprises a video stream. and an audio stream having mutually different frame rates, and the broadcast media stream includes a junction point into video referenced to a video frame of the video stream, the method comprising deriving a junction point into audio as an audio frame from the media stream stream at or immediately after the junction point into video, and output the replacement media item's audio content from the junction point into audio.
In accordance with another aspect of the present invention, there is provided a method of outputting an audio-visual replacement media item in a media output stream in a media output device, wherein the media output stream comprises a stream of video and an audio stream having mutually different frame rates, wherein the audio content of the replacement media item is output with a frame timing synchronized with the audio stream of the broadcast media stream.
According to another aspect of the present invention, there is provided a method of outputting an audiovisual replacement media item in a media broadcast stream at a media broadcast device, wherein the media broadcast stream comprises a video stream. and an audio stream, and the broadcast media stream includes an inward junction point, wherein the audio content of the broadcast media stream is decoded from the encoded audio data and, if the encoded audio data for the streaming media immediately before the junction point inwards arrive too late to be outputted before the audio content of the replacement media item from the junction point inwards, outputting simulated audio content before the junction point to inside instead of the audio content of the broadcast media stream.
According to another aspect of the present invention, there is provided a method of outputting an audiovisual replacement media item in a media broadcast stream at a media broadcast device, wherein the media broadcast stream comprises a video stream. and an audio stream, and the broadcast media stream includes an inward junction point and an outward junction point, the method comprising outputting simulated audio content subsequent to the audio content of the replacement media item if the broadcast of the audio content of the replacement media item occur before the junction point out. The simulated audio content can comprise one or more audio frames synchronized with the audio stream of the broadcast media stream.
According to another aspect of the present invention, there is provided a method of encoding an in-frame media stream in an encoder for broadcast in a headend, the encoded media broadcast stream including a junction point message referenced to a frame. of the media stream at a time indicated by a media scheduler, the method comprising synchronizing the encoder's frame timing with the media scheduler's timing.
According to another aspect of the present invention, a media replacement system is provided in which one of a set of media items is selected at a program receiver for broadcast on a predefined partition, based on profile data available at the receiver. . Media item sets are programmed for partitions according to limitations pertaining to one or more attributes of media item subsets. The attributes pertinent to each of the subsets are aggregated and the programming of the set is performed based on the aggregated attributes of the subsets. In this way, programming complexity based on the individual attributes of subsets of media items is avoided.
Media items can be selected for inclusion together in the same set based on the similarity of their individual attributes. In this way, the application of unnecessary limitations, which would not apply to scheduling media items on an individual basis, is avoided. Conversely, media items can be selected to be included together in the same set based on having vastly different individual attributes, on the grounds that limitations based on attributes of other sets of media items can be more easily satisfied against widely different attributes from the current set .
Each of the media items has an associated segment definition, defining an associated set or range of receiver profile data values that can be expressed as one or more rules and/or data. The receiver selects which media item to output based on a comparison between the segment definition and the profile data. Media items can be selected for inclusion in an aggregate set in such a way that the segment definitions of media items in the aggregate set do not overlap. In this way, each receiver will select no more than one media item to issue from each set of aggregates. Consequently, the selection of media items issued by a specific receiver is deterministic and does not require reporting of those specific items. The deterministic selection aspect at the receiver, based on predetermined receiver profile data and non-overlapping segments, is considered to be independently inventive.
Alternatively, segment definitions can be allowed to overlap, and a selection among multiple possible media items can be performed at the receiver based on priority levels associated with and/or independent of the predefined partition. This can allow for improved targeting of audiences, for example, by matching a show's expected audience profile to the segment definitions of the media items scheduled for the partition.
The selection among multiple possible media items may alternatively or additionally be based on frequency or time limitations, eg based on previous selections of media items by the receiver.
Selection among multiple possible media items can be made at least partially on a random or pseudo-random basis, optionally weighted based on one or more of the criteria mentioned above.
Receiver profile data can vary by transmitting variable receiver profile data items to the receiver. Receiver profile data items can refer to the segment definitions of a specific set of media items. In this way, segments can be flexibly defined, and can vary for each set of media items. The receiver profile data needed to select a media item from a specific set of aggregates can be communicated to the receiver, optionally in combination with segment definitions to determine the application of each segment to the receiver profile data. Receiver profile data can be derived from a profile database containing information regarding receivers and/or their associated users. Thereby, the need to communicate large amounts of profile data to a receiver can be avoided; rather, the necessary profile data is communicated to the receiver only as it is needed. Profile data items can be customized for a specific set of media items, in which case the selection rule can be a simple match rule, and that does not require complex processing by the receiver. Alternatively or additionally, a common set of profile data items can be reused between different sets of media items and their associated segment definitions, thereby avoiding the need to frequently communicate new profile data items. Brief description of the drawings
There now follows, by way of example only, a detailed description of embodiments of the present invention, with reference to the figures identified below.
Figure 1 is a schematic diagram of the major components of a media replacement system in one embodiment of the present invention.
Figure 2 is a flowchart of the steps involved in operating the media replacement system.
Figure 3 is a flowchart of steps performed by the receiver in determining which media items to acquire.
Figure 4a is an entity relationship diagram for the attributes of an aggregated campaign.
Figure 4b is an entity relationship diagram for the attributes of an aggregate replacement campaign.
Figure 5 is a diagram of a replacement partition containing a single advertiser multiple copy campaign in one embodiment of the invention.
Figure 6 is a diagram of a replacement partition containing three single copy campaigns from multiple advertisers in one embodiment of the invention.
Figure 7 is a diagram illustrating the scheduling of a replacement campaign aggregated into a partition in an embodiment of the invention.
Figure 8 is a diagram of a modality in which constraint satisfaction is partially performed in the receiver.
Figure 9 is a flowchart of a process performed at the receiver, in the embodiment of Figure 8.
Figure 10 is a diagram of a first modality of a join architecture.
Figure 11 is a diagram of a second embodiment of a junction architecture.
Fig. 12 is a diagram of encoded input frame timing, broadcast and replace video in a first splicing mode.
Fig. 13 is a diagram of encoded input frame timing, broadcast and replace video in a second splicing mode.
Figure 14 is a diagram of a broadcast flow and corresponding receiver broadcast in an embodiment of the invention.
Figure 15 is a diagram of the functional components of a specific receiver modality.
Figure 16 is a diagram of the functional components of a specific embodiment of a computer system in embodiments of the invention. Detailed description of the modalities
Media Replacement System Overview
Figure 1 schematically shows the main components of a media replacement system in an embodiment of the present invention, in which the programs are video broadcast programs and the replacement media items comprise advertising video clips.
A sample broadcast receiver 1 comprises a personal video recorder (PVR) arranged to receive broadcast channels from a headend 2 via a broadcast link, and output at least one of the received broadcast channels to a video display 3. Receiver 1 stores profile data 5 identifying preferences and/or demographic data of one or more users or subscribers associated with receiver 1. Receiver 1 also stores media content 4, comprising replacement media items and associated metadata. Media items can be received over the broadcast link or other communication network link, in advance of their scheduled broadcast time.
A media insert function 6 detects the occurrence of a replacement partition in a currently received broadcast program, and can select a replacement media item to output to the video display during the replacement partition, in place of the linear media content on the broadcast channel based on the profile data. Linear media content will be broadcast by broadcast receivers for which substitution is not enabled, because the receiver is not capable of media substitution or because media substitution is inhibited. Linear media content will also be output by receivers for which overwriting is enabled, but the profile data does not match the segments of any of the replacement media items for that replacement partition, or the media item of Appropriate replacement was not received.
Optionally, the PVR can record visualization data 7 indicating the broadcast programs and/or media items emitted for display by receiver 1, for reporting purposes.
Descriptions of media content 4 required for receivers 1 are compiled by a central scheduling function 8 which determines the scheduling of media content 4. Media content 4 is output to a media broadcast function 9 for broadcast for receivers 1 in advance of the scheduled times of the media content. Program function 8 also outputs linear media items for insertion into a broadcast program executed by a program broadcast function 10.
All replacement media items for a replacement partition must be broadcast before the replacement partition occurs in the broadcast program. In some circumstances, each item must be broadcast multiple times to maximize the chance that all items will be received by the majority of receivers, in the event that some of the receivers are occasionally turned off or unable to receive broadcasts, however, it is not essential that all overwrite options are received by all receivers, since linear content broadcast during partition can be issued if the required overwrite option is not available.
The profile data 5 stored in the receiver 1 can be generated by a profile management function 11, and sent to the receiver 1 by a data transmission function 12 in the head end 2. The scheduling function 8 can receive the data from view 7 from receivers 1, and can be responsive to view 7 data when programming linear replacement and/or media items. Replacement broadcast method
Figure 2 represents the steps taken in a method of scheduling, distributing and displaying one or more replacement advertising campaigns in one modality of the invention. Each replacement advertising campaign may comprise one or more media items, sometimes referred to as 'copy' or 'copy items', each media item being associated with a viewer profile segment defined by segment data and/or one or more segment rules associated with that item. For example, an ad campaign for a range of cars might comprise a set of media items, each comprising an ad for a specific car in the range, designed to appeal to a market segment defined by the associated segment rule and/or data.
In the present embodiment the profile data 5 of each broadcast receiver 1 comprises a set of profile data items stored locally in the receiver. Each receiver 1 also has a unique identity, such as a subscriber card number (subscriber ID) stored on a smart card accessible by the receiver 1. The profile management system 11 accesses a subscriber details database 12 associated with the unique subscriber identities, including subscriber details provided when subscribing to the broadcast service, subscriber preferences provided via receiver 1 or other communication link, and/or third-party data that the subscriber has permitted to be used for this purpose. Consequently, the database 13 stores a wealth of profile data items, which can be used to define profile data and/or segments. However, it would not be feasible for each broadcast receiver 1 to replicate all of its associated data items in the profile database 13 so as to be able to make a comparison with the profile segments of any specific campaign. In addition, a fixed predefined set of profile data items may require excessive processing by the receiver to identify whether receiver 1 belongs to a specific segment. For example, a predefined profile data item may comprise a truncated postal code (used, for example, to determine a set of channels - for example, a bouquet or sub-bouquet - that receiver 1 is enabled to receive) while a profile segment can be defined by a much larger region. To determine whether the truncated postal code matches a specific region, receiver 1 would need to obtain a list of truncated postal codes corresponding to each region, and compare its truncated postal code to the list of postal codes.
Instead, in an S1 profile generation step, profile data items are generated from profile database 13 for use in one or more specific campaigns. For example, a campaign might include different media items for viewers in the north and south of England, so a campaign-specific profile data item can indicate whether a particular subscriber is located in the north or south of England. The profile management function 11 interrogates the profile database 13 and determines a campaign-specific profile data for each subscriber ID destined to receive the corresponding campaign. In this way, the profile data items stored in the profile database 13 can be flexibly used to define the segments for a specific campaign, without requiring a large amount of profile data to be broadcast to or stored in receiver 1.
Profile data can comprise a discrete set of profile data for each campaign, and/or general profile data that is not specific to a specific campaign. For example, general profile data may comprise data likely to be of general use in defining segments, such as gender, age group, location, socio-economic group, etc. this general profile data only needs to be updated occasionally, while campaign-specific data should be updated as new campaigns are introduced.
Also in the S1 profile generation step, campaign metadata is compiled, comprising: . For each campaign, a campaign ID and a list of segments. . For each segment, a segmentation rule and a media item identifier. . For each copy identifier, location information indicating where in the broadcast stream the media item is located.
In steps S2 and S3, updated profile data items and campaign metadata are acquired by recipients 1 in advance of the replacement partitions to which the campaign metadata refers. Note that the order in which steps S2 and S3 are performed is not important. Updated profile data and campaign metadata can be periodically streamed on one or more separate channels of programming channels and hidden from the users of receiver 1, and to which each receiver 1 can tune in periodically, such as once a week. Profile data items can be divided into blocks according to subscriber ID, so that receiver 1 need only receive the block relevant to its subscriber ID, thereby reducing the time for which receiver 1 needs to be tuned to the hidden channel.
In step S2, each receiver 1 acquires its corresponding updated profile data items and updates its locally stored profile data accordingly. Campaign specific profile data may be broadcast in encrypted form such that only receiver 1 having the associated subscriber ID can decode the corresponding campaign specific profile data item(s), by example, using a key stored on the smart card.
In step S3, each recipient 1 acquires and stores campaign metadata, and builds a replacement copy list for itself by the following process, as shown in figure 3. For each campaign (step R1), recipient 1 considers each segment of each once (R2), parses the associated segmentation rule, and tries to match the segmentation rule with its stored profile data (R3). If a match is found, then the media item identifier for that segment is written to the replacement copy list (R4) and recipient 1 moves to the next campaign (R6); otherwise, receiver 1 considers the next segment (R5). Since receiver 1 can only issue one replacement media item at most per replacement partition, it is not necessary to consider other segments in a campaign after a match is found.
Segmentation rule and profile data can be defined in many different modes. In one modality, campaign-specific profile data can simply indicate into which segment associated recipient 1 has been categorized. The segmentation rule then merely requires recipient 1 to match its previously indicated segment with one of the segments in the campaign metadata. In another modality, each segmentation rule can be expressed as a combination of different profile data items, which may not be campaign specific, for example: IF (SEX = male) and (REGION = Borders or Scotland) then SEGMENT = 1 IF (SEX = FEMALE) and (REGION = Borders or Scotland) then SEGMENT = 2 and so on.
Alternatively, profile data could be dispensed with entirely and campaign metadata could explicitly identify recipients belonging to each segment. In this case, profiling is performed internally in the profile management function 11.
In an S4 media content distribution step, each receiver 1 acquires the media items identified in the replacement copy list. Media items can be stored on a partition on a local hard drive, for example. If an identified media item is already stored locally, it may be removed from the replacement copy list and does not need to be purchased.
In an alternative modality, each receiver 1 can acquire and store all media items for a campaign, and can select one of the media items for broadcast based on a later comparison of the profile data associated with the segment definitions for that campaign. . This alternative wastes more local storage but allows the order of steps S2 and S3 to be reversed.
In an S5 programming step, the scheduling function schedules the replacement campaign into the broadcast program, as described in detail below. In summary, this step generates a replacement program that indicates which replacement campaigns can be shown in which replacement partitions in a broadcast program. Each replacement partition is defined by a junction point that indicates the specific frame timing of the start and/or end of the replacement partition on a specific broadcast channel.
At this stage, automation events are reserved in the broadcast program as metadata in the replacement partition to allow program 10 broadcast function coders to generate junction point messages and perform any necessary flow conditioning to aid junction in receivers 1 Additional automation events may be reserved in the broadcast program at or before the beginning of each program interval containing replacement partitions to allow replacement options to be communicated to receivers 1.
In an S6 playback step, a reserved automation event (or alternatively an event generated by the automation function generated using a look-ahead replacement partition) causes the 10 broad cast program broadcast function in a trigger track associated with a broadcast channel, a replacement interval program comprising a list of campaign IDs for each replacement partition. Receivers 1 tuned to that channel receive and process the replacement interval program to determine for each replacement partition whether a locally stored media item is available having the indicated campaign ID for a specific partition; if this is the case, that locally stored media item is inserted into the partition in place of a linear media item included in the broadcast channel. Optionally, each media item can comprise a plurality of versions (e.g. standard or high definition) of the same content, and receiver 1 can select one of the versions to broadcast, e.g., based on a broadcast mode (e.g. , standard or high definition).
Selected media items are suggested by receiver 1 for broadcast at defined junction points of associated partitions on the broadcast channel. The automation function then generates a join point trigger at the point indicated by the replacement partition which is then reissued to the encoder and used to signal the receiver to condition the stream from send to join. Junction points can be defined as junction events on the broadcast channel using the SCTE 35 standard. When receiver 1 receives the junction event, it outputs the selected locally stored media item to the corresponding partition, if available, in place of the live broadcast stream. At the end of the replacement partition(s), indicated by the duration of the Join event or an additional Join event, the emission from receiver 1 reverts to the live broadcast stream.
In an update step S6, receiver 1 can delete stored media items that are no longer needed, for example, that no longer match the stored profile data after the last ones are updated, or for which the associated campaign has expired. Recipient 1 can also delete campaign-specific profile data items and/or campaign metadata associated with an expired campaign. Alternatively, previous versions of at least the profile data and campaign metadata can be stored in recipient 1 for reporting or diagnostic purposes.
Receiver 1 can update a counter associated with a specific campaign if a media item associated with that campaign has been issued. The receiver may update a counter associated with respective individual media items when that media item is issued. The receiver 1 can transmit the preview data 7 associated with a specific campaign to the profile management function 11, where the database 13 can be updated with the preview data 7. campaign attributes
In both linear and replacement programming, a specific campaign can have some or all of the following attributes: Demographic - the target audience for the campaign. campaign targets
Central Interval Ratio - the proportion of advertising media items to be shown at an interval within a broadcast program, rather than between broadcast programs. Halftime position
Top-Bottom - The number or proportion of partitions at the beginning and end of a range (considered more desirable than the middle of the range). Target ratings
Strike Weight - A measure of how the campaign's display frequency varies over time. Universe - the number of individuals in the demographic area being targeted by the campaign. Collision Code - a category code used to implement restrictions imposed by regulators regarding how ads can be placed together in a program (for example, ads related to car and alcohol should not be shown in the same range).
One or more reporting categories - code for the type(s) of product being advertised; these can be used for reporting purposes but may also impose restrictions on other ads shown in the same range; for example, copy items from different campaigns advertising the same type of product cannot be shown in the same range. The programming relationship itself can include the following attributes:
Restriction codes (by time) - for example, codes that indicate time restrictions for certain types of advertisements, such as a watershed.
Cast List - The list of cast members, who appear on a broadcast program.
Also, an individual copy item (ie media) for a specific campaign has its own set of attributes or metadata:
Duration - that is, the ad display period.
Clock Number - A unique identifier for the media item.
Restriction codes - A media item for a campaign has a set of restriction codes, which can be set only after the booking stage. Codes define properties of the media item's content that may limit the programming of the media item, such as the type of product or service being advertised, the minimum age of the viewer, or the watershed after which the media item can be shown.
Cast List - The list of cast members that appear in the media item. Regulations may stipulate that there must be no overlap between cast members in one ad slot and cast members in the previous and/or next show, so cast list attributes must be specified for each advertising media item.
Figure 4a shows the key entity relationships between attributes and campaign and campaign copy (ie media items) in a non-aggregated campaign. The Collision code has a one-to-one relationship to the campaign as a whole, while the campaign target and reporting category has a many-to-one relationship to the campaign as a whole. The campaign can have a one-to-one relationship with a product category, whereby the relationship with the collision code and reporting category is acquired. Individual copy items have a many-to-one relationship to the campaign as a whole; in other words, each campaign can have one or more copy items associated with it. Cast Members, Restriction Codes, and Performance Codes individually have a many-to-one relationship with an individual copy item.
Hence, it can be seen that a campaign comprises a set of media items with some attributes (campaign target, collision code, report category) associated with the set as a whole, while other attributes (cast member, restriction code, presentation code) are associated with the individual media items (or subsets of media items) in the set. Replacement variants
Different replacement variants can be used, based on the number of campaigns and copy variants of those campaigns scheduled in a partition in a program relationship. Each partition contains a linear media item that is included in the broadcast channel, for output by receivers for which substitution is not enabled, or for which profile data is not addressed by any of the segments.
Figure 5 shows a first variant, referred to as Single Advertiser Multiple Copy (SAMC), in which the S partition is programmed to contain a linear media item L and multiple replacement media items from a single campaign C The Seg1, Seg2, Seg3 segment data for each replacement media item defines the segment addressed by that item.
Figure 6 shows a second variant, referred to as Multiple Advertiser Single Copy (MASC), in which the S partition is programmed to contain one linear media item L and multiple replacement media items, each media item being from one campaign. different C1, C2, C3 the SegA, SegB, SegC segment data for each media item defines a segment addressed by that item, but different campaign segments can be defined in terms of different profile data items or segment rules ; this creates the possibility that the segments might overlap so that some receivers cannot determine which copy to emit based on a comparison with their profile data.
In a full variant, referred to as Multiple Advertiser Multiple Copy (MAMC), the partition is programmed to contain replacement copy from multiple campaigns, with more than one of the media items belonging to the same campaign, and addressed to different segments . Therefore, MAMC is a hybrid between SAMC and MASC. Schedule
Scheduling may need to be done in two stages: 1. Booking - placing campaigns into a broadcast relationship that is known in advance. Booking can be made sequentially, as campaigns are made available for scheduling. 2.Pre-broadcast check - check immediately before broadcast that scheduled campaign media items meet required limitations with reference to the final version of the relationship immediately prior to broadcast.
Pre-broadcast verification may be necessary as an additional step to reservation, because broadcast programs may have changed from the early broadcast ratio, for example, broadcast timing may have changed due to hacks or news flashes, or the content of the program may have changed, or may be known to include material such as news items that may clash with specific content in a media item.
Advertising campaign scheduling, based on the attributes or metadata listed above, is a combination of two formal classes of computation and mathematical problem, namely, constraint satisfaction and reservation optimization involve constraint satisfaction based on attributes of the relationship. and campaigns within an interval, and optimization based on campaign targets from different campaigns. Pre-broadcast checking involves throttling satisfaction based on attributes of the schedule relationship and the media items reserved in a specific range. Examples of these limitations include:
Booking limitations. The duration of the partition in the range must meet or exceed the duration of the media item. . The collision codes for the campaign must not collide with the time-based restriction codes for the relationship. . Collision codes for the campaign must not collide with other collision codes for other campaigns contained in the range.
Booking optimizations. The reservation of a partition must make efficient use of the demographic inventory in the relationship; in other words, the expected demographic profile of viewers of a partition in the relationship should match as closely as possible the target demographic area of campaigns reserved to that partition. . The partition reserve should contribute to campaign targets such as rankings and campaign distribution ratios (mid-end range, position in strike weight range, etc.).
Prestream Verification Limitations . The media item must not contain any cast members in common with adjacent programs (previous or next). . Restriction codes applied to the media item must match the schedule content, interval, and time of day.
In linear programming, the optimization and constraint satisfaction problems above require substantial computing resources, partially in the case where time-critical reprogramming is required during pre-stream verification.
Replacement advertising introduces multiple alternate media items, potentially from multiple different campaigns, into the same replacement partition at an interval. Replacement advertising causes additional complications, as follows:
Additional Booking Limitations. The partition duration in the range must meet or exceed the duration of each media item scheduled for that partition. . The durations of replacement media items in a partition must all be the same (or at least add to the same duration); for example, two or more shorter media items can be sequentially reserved in a partition with the proviso that the total duration of the sequential media items is equal to the duration of the partition. . Collision code checks against the relationship must be applied across all replacement variants of the replacement partition. . Collision code checks between media items in the range must be applied across all replacement variants of the replacement partitions. This could potentially include all additional replacement partition variants in the range.
Additional reserve optimizations. Bookings of all replacement media items in a replacement partition should make efficient use of the demographic inventory in the relationship. . The reservation of all replacement media items in a replacement partition must contribute to their respective campaign targets such as campaign rankings and distribution ratios (mid-end range, range position, strike weight, etc.).
Additional prestream limitations. No replacement media item can have cast members in common with the previous lineup. . Restriction codes applied to all substitution variants must be compatible with the schedule content, interval and time of day, taking into account that there can be more than one substitution partition in a interval.
These additional requirements have the effect of significantly increasing the number of calculations that need to be performed to ensure that a range's programmed content complies with relevant limitations and optimizations. These calculations need to be performed every time a booking is performed, and also as part of the pre-transmission check.
Consider an example of a range containing 5 partitions, two of which are replacement partitions. The first replacement partition contains a SAMC campaign with 3 replacement options. The second replacement partition contains three MASC campaigns along with the linear campaign. This provides the following range composition: . 5 partitions in range. 8 campaigns in range. 11 media items in range . 20 range copy variants
During booking, only campaign compliance is considered, which results in a processing lift of 5/8 or 60%. During pre-transmission verification, copy compliance must also be performed. If compliance is performed as if all media items are shown together, this results in a 6/5° or 120% processing lift. However, this simplification introduces the limitation that campaigns with the same collision code cannot share the same replacement partition despite the effect that the collision codes are intended to avoid (for example, two campaigns with the same collision code being shown in the same interval) could never occur. A more correct approach would be to consider all copy variants at a time which, even without optimization, would increase throughput by 20 times in the example above. Aggregation
In a first embodiment of the invention, at least some of the above problems are overcome by a process in which the complexity of the replacement model is substantially reduced to that of the conventional linear model. The present inventors have noted that the attributes that belong to a single campaign and its associated copy items, and the relationships that campaign and copy items have to schedule and other copy items in a range, are broadly similar regardless of whether a combination of single copy/campaign item or an aggregate of many campaigns and many copy items are considered. With reference to the entity relationship diagram in Figure 4b, if the Campaign entity is replaced with an Aggregate campaign and the Campaign copy item with multiple Campaign copy items, then the only change that would need to occur is that the relationship between Campaigns and Collision code would change from “one to one” to “one to many”. All other relationships would remain the same. This shows that an aggregation scheme can allow replacement advertising to be programmed in a way similar to standard linear advertising.
In an aggregation scheme, multiple replacement media items are treated as a single aggregate for reserve purposes in a linear relationship. In other words, attributes that are specific to individual media items, or to a subset of the media items, are aggregated together and the aggregated attributes are treated as having a many-to-one relationship to a single Aggregated Campaigns entity, referred to as an aggregate campaign. The aggregate campaign is then reserved in the relationship by applying the limitations and/or optimizations to the aggregate attributes.
The aggregation scheme will now be explained in more detail, with reference to Figure 7. An aggregate campaign A is composed of a single linear media item L and a single “pod” P which in turn contains one or more media items. that belong to different campaigns C1, C2, C3. Media items are selected so that user segments SegA, SegB, SegC of media items in a pod do not overlap; this means that a given specific user profile will be comprised in one segment at most.
Attributes from the constituent media items of aggregate campaign A (including booking limitations and campaign targets) are aggregated together and the aggregate campaign is scheduled using the aggregated set of attributes as if it were a single set of attributes for a single campaign. In a similar fashion, an aggregate campaign A comprises individual media items for each of the campaigns in the aggregate. The relationship includes a set of aggregate partitions, on which aggregate campaigns can be scheduled.
P-Pods are formed by grouping compatible replacement campaigns C1, C2, C3 together. Replacement campaign compatibility is assessed on the following factors: . campaign segment overlay . target demographic area. campaign duration. media item length
Each P pod is assigned a unique identifier. Note that the same replacement campaign can be associated with more than one P pod.
Each P pod is grouped with a linear campaign L to form an aggregate campaign A. each aggregate campaign A is also assigned a unique identifier. Note that the same pod P can be grouped with more than one linear campaign L, to form a corresponding plurality of aggregate A campaigns.
Campaign targets from constituent campaign items in the aggregate campaign can be aggregated into a single set of campaign targets that become the campaign targets for that aggregate campaign A. Alternatively, campaigns can be selected for inclusion together in a pod P based on compatible campaign targets.
Aggregation attributes can cause a cap to be applied unnecessarily, such that aggregate campaigns cannot be scheduled at an interval. For example: . aggregate drive A1 is first reserved in a partition at an interval, and has a car collision code; . Aggregate campaign A2 also contains a car collision code and is required to be reserved in another partition in the same range.
Based on this information individually, campaign A2 cannot be re-booked in the range, because a booking limitation prevents two media items having the same collision code from being shown in the same range. However, additional information is available about the breakdown of the aggregate campaign in question: . The A1 campaign selects a C1 campaign for a car from a first manufacturer if the subscriber is in the London region. The A2 campaign selects a C2 campaign for a car from a second manufacturer if the subscriber is in the Border region
Consequently, if the segments of campaigns A1 and A2 are brought into contact, it is evident that campaign A1 and campaign A2 cannot both select a car ad for a given subscriber, since the segments of the two car campaigns do not match. overlap; a subscriber cannot be both in London and in the border region.
As a solution to this problem, in case a collision rule is invoked between two aggregate campaigns, the aggregation function can communicate to the scheduling function if the collision is reconcilable, for example, because the segments between the two campaigns do not overlap. where there is a Collision rule invoked. This communication could take place in real time or the reservation could be allowed and marked as having an alert state and an asynchronous process can query the aggregation function for all reservations with an alert state and avoid reservation where the aggregation function indicates that the collision is irreconcilable.
The use of aggregate campaigns, each having the aggregate attributes of the multiple replacement campaigns contained in them, addresses the additional reservation and pre-broadcast verification limitations of a replacement system, without requiring significant changes to a linear scheduling system, and only with a modest increase in processing complexity. This is true regardless of the number of segments and replacement options contained in a P pod. Separate booking
In a second modality, one or more linear media items may be reserved in an available partition separately from the replacement media items, and preferably before any replacement media items are reserved in that partition. Booking of linear media items can be accomplished using conventional booking techniques. However, it is then preferable to indicate for each partition which type of replacement media items can be reserved in that partition; this indication comprises data called “utility ratio” that is generated and can be updated during booking.
The utility relationship data can be based on one or more predetermined substitution rules from the host campaign to which the linear media item belongs. For example, if the host campaign targets “adults” then it allows replacement utilities for upper-tier high-income households.
Utility ratio data may indicate limitations on replacement media items that can be reserved in the range as a whole, such as: . collision codes referring to programs before and/or after the break . collision codes or adjacency rules pertaining to media items booked in other partitions in the range (for example, if a car ad is already booked in the range, don't reserve an alcoholic beverage ad in a utility) . watershed compliance codes and HFSS (high fat salt and sugar) exclusions
The utility ratio data can also indicate limitations on replacement media items that can be reserved on a specific partition in the range, such as: . partition length, determined by the length of linear media item reserved in that partition. Single/Multiple Advertiser: Indicates whether the replacement media items can be from a different advertiser than the linear media item . segment exclusions: defines which segments are not available for replacement advertising, for example because they are already allocated in that partition.
Replacement media items for each partition can be reserved as a P-aggregate pod as in the first modality. Alternatively, replacement media items can be reserved individually, in which case the segment deletions for that partition are updated as reservations are made.
Overlap segments between the different media items reserved in each partition are resolved according to a predetermined rule so that the segments no longer overlap. For example, priority can be given in order of booking; therefore, in the example above, the segments of the first replacement media item is (ABC1 NOT London). If a second replacement media item, subsequently reserve, is targeted to households with children, the effective segment for that item is (children NOT ABC1 NOT London).
In an alternative rule, although the linear media item is reserved first, it is given lower priority than any replacement media items subsequently reserved, and the replacement media items are given priority in reserve order. In this case, the segments would be: . linear item: London no ABC1 no children . 1st replacement item: ABC1 . 2nd replacement item: children not ABC1
Other segment priority rules can be used within the scope of the invention. For example, subsequent reservations in a partition can be avoided if the associated segment overlaps any of the segments already reserved in that partition. However, such a rule would require standardizing segment definitions so that overlap can be automatically determined, which reduces the flexibility of the booking system.
An advantage of the second modality is that reservations can be confirmed as they are requested, rather than requiring reservation requests to be held until an aggregate booking can be made, as in the first modality.
In a development of the second modality, the utility relation data for a specific partition may include one or more collision codes referring to media items already reserved in other partitions in the same range. For example, if an alcoholic beverage-related media item was reserved in another partition in the range, such as a linear or replacement partition, a collision code of 'alcoholic beverage' may be included in the utility relation for the specific partition a rule The pre-determined collision code then prevents a media item with a collision code of 'car' from being reserved in the specific partition, to avoid the possibility of media items related to liquor and car being shown in the same partition. Fractional Partition Durations
Scheduling fractional media items having a duration that is a fraction (such as half) of that of a replacement partition creates additional limitations in which a fractional media item must be matched to one or more other fractional media items and scheduled sequentially from to compose the duration of a replacement partition. In one solution, fractional media items are concatenated together to form a concatenated media item having the aggregated attributes of the constituent media items, and the concatenated media item is then treated as a single media item with the aggregated attributes for purposes of schedule.
In another solution, fractional media items are scheduled in an aggregate campaign, and the broadcast substitution ratio for the receiver indicates that the fractional media items should show sequentially rather than as alternates. For example, the list might indicate the following replacement options: 1 .Replacement campaign 12345 2 .Replacement campaigns 1111 and 2222 in sequence
In this solution, the concatenation of fractional media items does not need to be performed prior to scheduling, but the need to schedule fractional media items sequentially creates additional limitations that must be resolved by the reservation system.
Disable replacement options
In the modality described above, it is assumed that after a campaign or aggregate campaign is scheduled for a partition, any of the replacement options can be selected by one or more recipients, once the scheduling limitations have been met. In an alternative embodiment, one or more replacement options with an aggregate campaign or campaign may be selectively disabled at or shortly before broadcast time, for example by modifying the replacement ratio. This selective disabling can be used to control how often each override option is displayed. The replacement options to be disabled can vary during a campaign, so the distribution of certain replacement options can be balanced with the need for reprogramming.
This technique could be applied to a linear scheduling scheme, in which a scheduled campaign defines an inventory of possible media items for a partition, and the linear item for that partition is selected from the inventory of possible items.
Variable Replacement Options
If the same replacement campaign (including an aggregate campaign) is scheduled across multiple replacement partitions, with the same associated campaign metadata and profile data, a specific recipient 1 will deterministically select the same replacement option each time the campaign is scheduled. In some cases, it may be desirable to vary the replacement option for a specific recipient each time a campaign is scheduled.
In one embodiment, each media item may comprise a sequence of clips, with a clip from the sequence being selected each time for broadcast by the receiver each time the associated media item is selected for broadcast. This mode is particularly advantageous for distributing media items having an overall length that is greater than that of a replacement partition, and allows distributing a series without the need to schedule each clip in the series in a different sequential campaign. Prioritization
One of the problems mentioned above is controlling the distribution of replacement media items in order to optimize the probability of a specific media item, addressed to a selected audience segment, being broadcast by recipients 1 comprised in that audience segment. This issue cannot be individually resolved by programming, because predicted audience profiles cannot be determined for the variety of segments that the replacement media items could address.
The problem can be illustrated by a practical example: the 'Doctor Who' series provided by the BBC is predominantly watched by children, or at least homes including children. However, there are several smaller segments that also watch the series, such as students, science fiction fans and so on. Ads suitable for children are unlikely to appeal to these smaller segments, and vice versa. Furthermore, these smaller segments overlap to some extent, so optimal targeting cannot be achieved merely by setting respective replacement options for students, science fiction fans, and so on. However, a specific advertiser may wish to target one of these smaller segments, and may have identified the ‘Doctor Who’ series as an appropriate means to reach that segment.
Also, the probability of a media item hitting its target segment is not necessarily proportional to the number of placements of that media item in a relationship, due to the size of each segment. For example, a media item targeted at a location containing only 1000 households is only likely to be selected by a subset of the 1000 households regardless of the number of placements, whereas a media item targeted at men in the South East of England may result in hundreds of thousands of selections, if only placed on a few partitions in a relation.
One solution would be to push the replacement decision-making process almost entirely to the receiver, however, as identified above, this requires too much processing and data storage capacity at the receiver.
In the present modality, instead of using a deterministic substitution process as described above, priority ratings referring to the replacement media items are transmitted to the receivers, and the selection of replacement media items by the receivers is based on the ratings. of priority. Priority rankings can include global priority rankings and/or priority rankings that are specific to receivers or groups of receivers. Priority rankings may vary over time.
Since the replacement system is not deterministic in this modality, different replacement media items assigned to a specific partition can have overlapping segments. Consequently, replacement media items are reserved in partitions subject only to the reservation and pre-streaming limitations described above. This increases the likelihood that a receiver comprised of a segment of a media item will be able to select that item.
A rating system, external to scheduling function 8, collects information from receivers 1 and/or other sources to allow ratings for replacement media items to be determined. Global priority rankings are then calculated for each media item or set of media items, based on the associated segments. These global priority ratings are broadcast on a daily basis to all 1 receivers, which store priority ratings for the associated locally stored replacement media items.
A system external to scheduling function 8 determines the degree of match between an expected audience profile for a partition, and the segments of replacement media items reserved in that partition. This matching grade can be used to calculate a specific priority rating for each of the replacement media items, although other criteria can be used. Specific priority classifications are broadcast to receivers 1 in the substitution relation data, broadcast just before the partition broadcast time. Specific priority ratings can be implied, for example, by broadcasting a specific rating value associated with each replacement media item, or implied, for example, from the order in which replacement media items are assigned to a partition specific in the replacement ratio data.
When receiver 1 receives the replacement ratio data, it selects a replacement item for issuance, based on a comparison between the segment of receiver 1 and the segments indicated for the replacement media items, as described above. However, in this modality there may be more than one replacement media item that matches receiver segment 1, in which case one of these is selected for broadcast based on its specific and/or global priority ratings. The media item having the highest priority rating can be selected, or a random (or pseudo-random) selection can be made of the matched media items, weighted according to the priority ratings. Some of the weights might be zero, so for example media items having a low priority might never be selected. Zero weighting can be based on one of the priority rankings, such as the specific priority ranking, with the remaining media items being weighted according to the global priority rankings.
A priority ranking threshold can be predefined, either globally or on a per-campaign basis, such that priority rankings falling below the threshold are allocated zero weight by receiver 1 or are otherwise prevented from being selected for issuance. If none of the possible replacement media items for a partition have a priority rating above the threshold, the threshold can be adjusted down so that one of the possible media items can be selected.
In this modality, receiver 1 can alternatively or additionally select a replacement media item for broadcast based on a local priority ranking, based on historical or other criteria specific to receiver 1. For example, a predetermined maximum value can be adjusted on the number of times each media item is output by receiver 1, such that receiver 1 will no longer select that media item for output after the maximum has been reached, but may instead select another media item, possibly having a lower priority rating. As another example, a minimum interval between successive selections of the same media item can be set such that receiver 1 is prevented from reselecting a media item when the interval less than the minimum has passed. As another example, a start date limitation can be set such that a media item cannot be selected for issuance before a specified start date.
More generally, the local priority rating of a replacement media item may be a function of the global priority rating, the time left until the end of the campaign, and/or the difference between the number of times the item has been issued and the predetermined maximum number of times the item can be issued. For example, the local priority can increase as the time left until the end of the campaign is reduced. Local priority may decrease as the number of times the media item has been broadcast approaches the predetermined maximum.
The above criteria can be defined locally on receiver 1, or can be communicated to receiver 1. The criteria can be specific to specific media items or sets of media items. In this way, the distribution of media items can be controlled in order to optimize their exposure to the target segment. Linear media item segment
In at least some of the embodiments described here, it is assumed that the receiver will always perform media replacement, if an appropriate replacement media item is available, rather than issuing the linear media item to a partition. In these modalities, the linear media item is selected as a default issue. A disadvantage of this approach is that the target audience of the linear item may not match the profile of a specific recipient.
In an alternative embodiment, a segment is defined for each linear media item, and is communicated to receivers so that receivers can choose to output the linear media item if the associated segment matches the stored receiver profile. Otherwise, recipient 1 may issue an available replacement item.
The linear item segment can be defined by creating a campaign ID for the linear item, broadcasting that campaign's segment definition at the S3 campaign metadata distribution stage, and indicating the campaign ID for the linear item in the range relation in step S6. The receiver then selects the line item to issue if the associated segment matches the receiver profile. Linear item can be selected in preference to any replacement media item. Alternatively, a specific priority ranking can be defined for the line item as well as replacement media items as described above, and a selection can be made between the line item and one or more available replacement media items, with based on their relative priority rankings. If necessary, the linear item can have a top priority ranking.
Alternatively, the segment for the linear item can be signaled just before the associated interval, for example, in the trigger track along with the interval relation. Receiver 1 then determines whether its profile is comprised in that segment and if it is, it does not perform substitution but emits the linear item in its associated partition.
The segment for the line item can be defined in terms of any of the profile data stored in receivers 1, including general profile data or campaign specific data, as described above. Campaign-specific data may or may not be specific to any campaign ID created for the line item. Limitation satisfaction in receiver
In the previous modalities, limitation satisfaction is performed entirely by the central scheduling function 8. A problem with this approach is that the selection of replacement media items between different partitions can be over-limited, since it is assumed that any of the replacement media items programmed for a specific partition can actually be issued by a receiver in that partition. For example, one of the replacement media items programmed into a partition could be alcohol related; this would prevent a carriage-related replacement media item from being programmed into another partition at the same program interval. As a result, too few replacement options may be available, and media items having certain collision codes or adjacency rules may be difficult to program.
In the present mode, the constraint satisfaction is divided between the central scheduling function 8 and the receivers 1, as shown in figure 8. The scheduling function 8 performs constraint satisfaction (step P1) for constraints that apply to all receivers 1, such as partition length, compliance codes (eg, watershed, HFSS) and restriction codes pertaining to adjacent programming, while receivers 1 perform each constraint satisfaction for constraints that are specific to the receiver, such as codes collisions between replacement media items in the same program interval.
The result of limiting satisfaction by the scheduling function 8 for each partition is a ‘long list’ LL identifying all possible replacement media items that can be issued in that partition. The respective ‘long list’ LL for each partition in a range is broadcast to receivers 1 in the substitution relation data immediately before the associated program range. CD limiting data, such as collision codes for each media item, is also broadcast to receivers 1, for example, as metadata received with the corresponding media items.
As in the previous modalities, each receiver 1 pre-records the replacement media item or items that match the profile segment of receiver 1 for each campaign. When receiver 1 receives the ‘long list’ LL for each partition, it determines (step P2) which of the indicated media items is available from local storage; these items will be available because they match the profile segment of receiver 1, and receiver 1 was able to receive and record them. The media items available from the ‘long list’ LL comprise a short list’ SL from which receiver 1 selects (step P3) up to one media item for output in each partition. If none of the indicated media items are available for a specific partition, then receiver 1 outputs linear media content (ie, currently broadcast) for that partition.
For each partition having a 'short list' SL, receiver 1 selects a media item for broadcast in that partition based, at least in part, on meeting collision code limitations with the media items selected for broadcast in any other partition. in the same range and/or with any linear content item to be emitted in any partition in the range. These collision code limitations are met locally at receiver 1, so limitations are only resolved between the media items actually selected for broadcast at receiver 1, and over-limiting between potential collisions is avoided.
In one variant, receiver 1 meets the collision code limitations by selecting the media item to be output in each partition in turn, and satisfying the collision code limitations for each subsequent partition based on the selection made for the previous partition or partitions. Collision code limitations can therefore comprise filters on the collision codes of media items that can be selected, based on the collision codes of previously selected items. These filters are relatively simple to implement in receiver 1.
Alternatively, receiver 1 can satisfy the collision code limitations by considering some or all possible combinations of selections from the SL short lists of each replacement partition in the program range, and exclude possible combinations where the collision code limitations between selections for different partitions are not met. The number of possible combinations is likely to be low, as there can only be 2 or 3 replacement partitions in a range, and only a few media items in each associated short list, so collision code limitations can still be satisfied. without too much complexity in receiver 1.
Collisions with any linear media items may need to be considered as well, unless 'long lists' are selected by programming function 8 such that there are no potential collisions with any of the linear media items on other partitions in the break.
Where more than one item is available for selection from a short list even after satisfying collision code limitations, or more than one possible combination is available, receiver 1 can select one of the items based on prioritization as described above.
A specific modality in which constraint satisfaction and prioritization are combined at receiver 1 is shown in Figure 9. In this specific modality, each replacement partition in a program interval is considered in sequential order.
For each replacement partition in a range, receiver 1 gets the long list LL and filters out invalid or unavailable items at step P2 to get a short list SL. In selection step P3, receiver 1 first filters the SL shortlist (step Q1) by removing those media items that do not satisfy collision code limitations with media items already issued in the current interval, as recorded by session data from SD range. SD session data can comprise collision codes of media items already issued in range. Receiver 1 may also remove those media items that have already been issued by the receiver a predetermined number of times and/or more recently than a predetermined interval, as determined from the CD campaign data. The result is an FSL filtered short list.
In step Q2, receiver 1 determines how many media items remain in the FSL filtered short list. If more than one, receiver 1 selects the media item having the highest priority (step Q3) which can be determined by a global, specific and/or local priority ranking as described above, which is then selected for broadcast (step Q4). If there is only one media item in the FSL filtered short list, that item is selected for output (step Q4). In either case, the CD campaign data is updated to record the broadcast of the selected media item, and preferably the broadcast time so that the interval since the last broadcast can be calculated. If there are no media items in the FSL filtered short list, linear content is selected for broadcast (step Q5).
After a replacement or linear media item has been issued, the interval session data is updated (step Q6) to record any collision codes associated with the issuing item. If the last replacement partition was processed (step Q7), then the process ends for the current interval but can be restarted for the next interval. If not, the process repeats in step P2 for the next replacement partition in the range. Additional media items
In an additional or alternative modality, recipient 1 may store additional replacement media items that are not allocated to a specific campaign, but may be selected for issuance in partitions where no campaign-related replacement media items are available to the recipient 1. These additional media items may be unscheduled, where they are not indicated in any replacement list, or they may be programmed into specific partitions.
Additional media items can be downloaded to receiver 1 by including them in a replacement copy list for receiver 1 as described above. This can be achieved by creating a pseudo-campaign for additional media items, with associated segments. In a specific example, the additional media items represent ‘hyper-local’ advertisements, for example relating to local businesses and services, and are divided into a large number of segments based on smaller geographic areas.
Receiver 1 can automatically select an additional media item to issue in any partition for which no scheduled replacement media item is available. Alternatively, the replacement relationship can designate only certain partitions as being available for additional media items, exclusively or as an alternative to one or more campaigns designated in the same partition. In this alternative, additional media items can be designated by a campaign ID corresponding to the associated pseudo-campaign.
Additional media items can be selected so as not to have collision codes that would conflict with other replacement media items in the same range, so limitation satisfaction does not need to apply to additional media items. Alternatively or additionally, additional media items can be split into multiple pseudo-campaigns each having different collision codes, and the replacement relationship can designate one or more specific pseudo-campaign IDs in a partition, so that the satisfaction of limitation is performed by the scheduling function 8. The aggregation function described above can be used to group additional media items into multiple pseudo-aggregate campaigns, each of which is programmed using the aggregate attributes of the additional media items contained in the aggregate campaign. This aggregation can be done automatically by selecting additional media items for an aggregate pseudo-campaign based on similarity of attributes. Aggregate pseudo-campaign segments can define geographic areas without their overlap. For example, a pseudo-aggregate campaign might refer to local Indian restaurants, with each media item referring to an Indian restaurant in a different small geographic area.
Alternatively, receiver 1 may perform limitation satisfaction of additional media items, by selecting for output an additional media item having a collision code or codes that do not conflict with other media items selected for output in the same range, by example, as described above. Additional media items will generally have low priority such that receiver 1 will only select an additional media item for output after all scheduled replacement media items have been selected on other partitions in an interval. Record & Replay
The above modalities have mainly been described with reference to the live viewing of broadcast programming, with insertion of replacement media items into the displayed live broadcast stream. In a mode where the received broadcast stream is recorded locally by receiver 1, such as a PVR, the inserted replacement items can be recorded in the received broadcast stream recording so that the content displayed over and over is identical to that seen when watching the live broadcast stream with any replacement media items inserted. This mode is advantageous in that the user can replay exactly the same content as seen when viewing the live broadcast stream. It should be noted, however, that the above modalities do not require the broadcast stream to be viewed live; instead, the stream could be recorded for later viewing, with replacement media items being inserted during recording, or linked to the recorded program so that they are automatically retrieved and spliced in over and over again.
In an alternative modality, recording may include data identifying the junction points and replacement relationship, and media replacement may be performed over and over, with the proviso that the necessary campaign metadata, profile data and replacement items are still available on the receiver, these items can be saved for the duration the associated recording is held on the receiver. this approach is more flexible as any updates to profile data, campaign metadata and/or placeholders can be taken into account when selecting a placeholder to repeat. However, the user experience is different from conventional recording, in which the user expects to see on replay the same content that was previously viewed live.
In this alternative modality, a replacement interval during replay (a ‘repeat interval’) may be defined differently from a replacement interval in a live broadcast stream (a ‘live interval’). For example, there may be fewer partitions defined in the repeat interval than in the broadcast interval. This is advantageous since, in repetition, the user is able to fully skip the range by fast-forwarding or skipping to the end of the range. By providing a shorter interval in repetition, there is less incentive for the user to skip the interval. In an alternative, the user can be prevented from skipping the interval by technical means such as inhibiting fast forward or jumping, but this is not too costly for the user as the repetition interval is relatively short.
An additional benefit of having fewer partitions in the repeat range is that constraint satisfaction is simplified; in the extreme case of only one partition per retry interval, bound satisfaction between different partitions in the interval is totally avoided. This is particularly advantageous in modalities where some or all of the limiting satisfaction occurs in the recipient.
The number of partitions can be reduced in the replay range simply by removing or skipping one or more of the partitions defined in the live range. The selection of which partitions to remove can be done according to metadata included in the replacement range relationship, for example. Alternatively, different partitions with different replacement interval relationship data can be defined for the repetition interval.
The replacement selection for a partition can differ between a live interval and a repeating interval, even with the same interval relation data. Selection may depend on replay time. For example, if more than a certain period, such as 7 days, has elapsed since the time of broadcast, overwrite can be enabled and the linear media item inhibited, or vice versa. One or more of the linear or replacement media items may have predetermined expiration times, specified, for example, by interval relationship data and/or campaign metadata, after which they may not be shown in the replay.
The repeating time of day can be taken into account, so media items having watershed constraints may not be selected outside the defined watershed times. Campaigns can have defined time periods after which they cannot be selected for issuance. If no other replacement media item is available, an additional media item can be selected as described above.
Similar approaches can be applied to a PVOD (Video On Demand Push) system in which broadcast programs are automatically recorded without specific selection by the user, as described for example in WO-A-06/125971. Report
It is also important to determine, or at least reliably estimate, the ratings for each campaign, in other words how many times the campaign was actually aired, and optionally, how many viewers of the target demographic of the campaign. In a conventional linear advertising model, research evidence is used to estimate the viewing digits for each placement at a specific time, and the rankings for a specific campaign are derived from those digits. In a replacement advertising model, additional information is needed to split those digits for each of the replacement options in an S partition, particularly if a replacement partition contains options from different campaigns.
If the segments of each of the campaigns in a pod P do not overlap, the selection of the campaign to be issued for each partition by receiver 1 is deterministic, given the profile data stored in each receiver 1. Therefore it is possible to determine or at least estimate the classification of each campaign, without detecting which campaigns were broadcast by a specific receiver 1. Instead, all that is needed is to determine or estimate the number of receivers 1 tuned to each broadcast channel, and the profile data of those receivers. In one example, view data 7 comprising data sets of the form [Subscriber ID], [Channel], [Time of day] are sufficient; this data can be collected by the profile management function 11 and combined with information from the aggregation function to determine which campaigns would have been issued by each receiver. This visualization data can be reported through feedback channels from receivers 1, or obtained from research evidence. In this way, the amount of data to be collected is minimized and reporting accuracy is improved. junction architecture
As described above, in response to a join event, receiver 1 issues a locally stored replacement media item at a junction point defined as a join event in a repeating or broadcast stream. Architectures that allow transport stream level joining at receiver 1 will now be described.
In a first embodiment shown in Figure 10, data is analyzed at transport stream level, timestamp information is modified, and the modified transport streams are re-injected into a demultiplexer 20. The demultiplexer 20 is of a conventional architecture in which a demodulated audiovisual transport stream 14 is provided to a demultiplexer input 21 and demultiplexed into data 22, such as Teletext data, an elementary packetized video stream (PES) 26 and an audio PES 27, for broadcast to middleware 30, video decoder 31 and audio decoder 32, respectively. The demultiplexer 20 also outputs a video timestamp (TS) 23 and an audio TS 24, analyzed from the transport stream 14.
In the first mode, the video and audio TS 23, 24 are input to a PTS trigger 33 that detects a discontinuity in the TS 23, 24 caused, for example, by joining a replacement media item in the transport stream 14. a discontinuity is detected, surrogate video and audio TS 35 are generated and adapted to the original TS references 34 to generate an adapted TS 36 that is continuous with the time references before the discontinuity. The adapted TS 36 is then reinjected into a TS input 25 so that the broadcast video and audio PES 26, 27 have the adapted TS 36. Thus, the video and audio decoders 31 and 32 do not encounter the discontinuity of TS.
In a second modality shown in Fig. 1, the audio and video PES 26, 27 is processed between the demultiplexer 20 and the audio/video encoders 31, 32. As a result, the second modality is simpler than the first modality and provides lower latency, since the need for a second pass through the de-multiplexer 20 is avoided.
In the second mode, the audio and video PES 26 and 27 are provided for triggering PTS 33, which detects discontinuities in the TS contained in the PES in a similar mode to the first mode. If a discontinuity is detected, surrogate PES 35 are generated and an adapted PES 36 is created with TS references continuous with those of the PES 34 before the discontinuity. The adapted PES 36 is output to the video and audio decoders 31, 32.
In either modality, scrambled and/or encrypted transport streams 14 may need to be split/decrypted at the same stage as the demultiplexer 30 so that the TS can be analyzed and modified. Junction Point Selection
In one embodiment of the invention, junction points are defined with reference to presentation time stamps (PTS) that are necessary for audio/video synchronization and are common to the audio and video streams of a specific input stream (by eg broadcast or repeat). In this way, a single junction point can be defined for both audio and video using the same reference.
To avoid decoding problems with interframe encoded video, junction points are defined so that there are no interframe references through a junction point; for example, there are no forward references before a junction point and no back references after a junction point. Preferably, junction points are defined between groups of frames where there are no references between groups, such as at the beginning of an I-frame (an independent frame) in a Group of Pictures (GOP) in MPEG-2.
Each replacement media item is coded independently so that it does not contain any interframe references outside of itself. Thus, an MPEG-2 encoded replacement media item will contain one or more GOPs and will start with an I-frame.
In one modality, junction points are selected at head end 2, and transmitted by the program broadcast function 10. An advantage of this approach is that receiver 1 does not need to analyze an MPEG stream, for example, to suspend MPEG decoding. until the beginning of the next GOP.
Each GOP is preferably encapsulated exactly in a PES packet. This ensures that a junction point always occurs at the beginning of a GOP; the PTS value is placed in a PES packet header which therefore indicates the start of a GOP. An additional advantage is that a Payload Unit Start Indicator (PUSI) bit in the transport stream header can be used to parse the stream to identify the start of a GOP, without having to read the frame type. from the Elementary Stream level, thereby reducing the level of processing resource required. As shown in Figure 12, an SP junction point is defined at the beginning of an I-frame of an EIV encoded input video stream. An ESV encoded replacement video stream is spliced at that point, also starting with an I frame. The resulting EOV encoded output video stream comprises the frames of the EIV encoded input video stream to the sp splice point, and the frames of the ESV encoded replacement video after the sp junction point. The DOV decoded broadcast video stream is delayed from the EOV encoded broadcast video stream due to the decoding latency, so the timing of splice point SP' in the DOV decoded output video is delayed relative to the splice point indicated SP.
In an alternative modality, each PES packet contains a single video frame, so each frame has its own PTS. This allows a junction point to be defined at any frame in a GOP, however the junction point must be selected so that de-building is not broken through the junction point. For example, an inward junction point can be defined after a P-frame in the EIV encoded input video since P-frame encoding depends only on earlier frames. Figure 13 shows an example similar to that of figure 12, but with the junction point on a GOP.
An outward join point should preferably be defined on a GOP boundary; otherwise, receiver 1 would need to delay the splice out until the next GOP in the EIV encoded input video; this could lead to a gap or freeze frame from the end of the replacement video for a short period of time - up to half a second for MPEG2 encoding, or potentially several seconds for H.264. this would also require receiver 1 to analyze the EOV broadcast encoded video stream to identify a GOP starting point, which is undesirable due to the need for additional processing resources in receiver 1, and the need to customize the receiver platform in a trigger/hardware level.
Preferably, the following requirements must be met at head end 9 to ensure continuous joining: . the first frame of the EIV input encoded video after the inward junction point must be an I-frame. the first frame of the EIV input encoded video after the inward junction point must be placed at the beginning of a new PES packet, and contains a PTS value. the first frame of the input EIV encoded video after the junction point out must be an I-frame. the first frame of the EIV input encoded video after the out junction point is placed at the beginning of a new PES packet, and contains a PTS value. the EIV input encoded video stream must use closed GOPs, that is, frames from one GOP do not reference any frame from another GOP. the last frame of the encoded replacement video must not reference a future frame, i.e., for MPEG2, it must be a P-frame or I-frame. the length of the ESV encoded replacement video must equal the interval between the join in and join out points
If any of the above requirements are not met, merging is still possible but may not be continuous. The following effects can be visible to the user: . freezing the last frame of the output video to up to a full GOP length at the beginning and/or end of the merge range. . even a full GOP of replacement video can be dropped at the beginning and/or end of the merge interval. . even a full GOP of unselected content could be visible at the beginning and/or end of the join range.
If there are multiple adjacent join ranges, these problems can compound.
While the above embodiments have been exemplified with reference to MPEG-2 video encoding, aspects of the invention are applicable to other video encoding formats such as H.264. audio junction
A specific problem can occur with decoding the audio stream, in which the audio decoder 32 may not be managed at receiver 1, but instead by an external amplifier for which no information is available as to when any splicing can occur in the stream. audio you receive. It is therefore desirable to ensure that the audio frame rate and sync remains continuous in broadcast to an external audio decoder 32 during replacement, to avoid any problems caused by the external amplifier receiving out-of-sync frames.
Figure 14 illustrates a BS broadcast stream comprising elementary audio and video packet streams 26, 27, comprising packets including presentation timestamps (PTS) indicating the time at which the content is to be presented, for example as broadcast by receiver 1, and VSS (start of video join) and VSE (end of video join) join messages. The effective timing of the video splice points is indicated as SPI (Junction Point In) and SPO (Junction Point Out). Figure 14 also illustrates the corresponding receiver output RO, comprising video and audio frames.
One problem stems from the fact that video frame and audio frame length don't line up; each video frame covers a period of 40 ms, for example, while an AC3 audio frame carries audio samples for a period of up to 32 ms. This means that the PTS value that references the effective video junction point in a junction message will not exactly match the PTS value of the PES that carries frame AC-3 in the stream to which the junction will be applied.
To overcome this problem, Receiver 1 determines the effective PTS value of the related audio frame by having a PTS value equal to, or the smallest value, greater than the Video PTS value for VSS Video Join Start and End , VSE. Typically, an audio frame comes after the associated video frame in the transport stream; this audio frame is therefore monitored in the live transport stream, in addition to the PES video junction point, especially for a repeating live junction, to determine the audio junction point. It is possible that the point when the PES for the last component appears in the stream is too close to the presentation time where the substitution should start, not leaving enough time for receiver 1 to operate the substitution in time. Receiver 1 may then switch from the broadcast stream earlier and miss sending one or more broadcast frames, as shown in Figure 14. In this case, receiver 1 will have to ensure that it maintains a compatible audio frame rate in compensating. the exact number of frames missing from receiver output, by generating mute frames locally, before replacement starts.
Similarly, the receiver 1 can locally output mute frames generated before an audio out junction point, if the in-join content ends before the indicated audio out junction point. Muted audio output is preferable to problems that can be caused by unsynchronized audio.
The effective size of the mute frame will be fixed, based on the audio sample rate parameter specified on the broadcast channel.
An additional problem is that the misalignment between video and audio frames in the broadcast stream is probably not the same as that in the replacement content. To overcome this problem, the audio frame timing of the replacement content broadcast to the audio decoder is aligned with that of the broadcast stream. This can cause an SE sync error between the audio and video of the replacement content during replay as the timing of the audio frames has been shifted relative, but this effect is preferable to the unknown errors that can be caused in external decoders by timing discontinuity. Junction Point Signaling
As discussed above with reference to Figure 1, headend 2 includes a media broadcast function 9 that encodes media content for broadcast, based on programming information provided by a programming function 8. Media broadcast function 9 includes junction insert messages in the broadcast stream, which signal the precise video frame in which a junction point will occur, with reference to a frame timing indicated by PTS for each frame. Each join insertion message is preferably inserted into the broadcast stream at a fixed interval before the join point occurs.
The timings of the junction points are signaled to media broadcast function 9 by programming function 8, with reference to a common clock. However, the programming function 8 is not aware of the frame timing of the encoded frames issued by the media broadcast function 9. The encoder must perform a conversion between the common clock reference made by the programming function to signal the time when the frame The junction point frame will be presented to the encoder and the frame timing that will be associated with the video junction point frame on output from the encoder, but if the encoder is not properly synchronized with the common clock used by programming function 9, the Junction insert messages can refer to the start of a frame just before or just after the junction point timing signaled by the programming function. This can lead, for example, to a frame of a linear media item being displayed on receiver 1 before displaying a subconstruction media item.
To overcome this problem, the encoder frame timing is synchronized with the clock reference of the scheduling function 8. This may require the scheduling function 8 to output a clock signal to the encoder for synchronization purposes, or alternatively both to 8 programming function as the encoder can be synchronized with a common clock reference.
For the case where the scheduling function 8 sends a clock signal to the encoder, the method comprises entering the UTC (Coordinated Universal Time) time in which the frame is reproduced and sent to the encoder input in the VITC (Code) field vertical interval timer) of the frame. The encoder can then set a clock that precisely locates the time limit at which each frame is received. The encoder will then be able to more adequately calculate in advance the frame timing associated with any future time reference provided by the scheduling function. Receiver Details
Figure 15 shows in detail the functional components of receptor 1 in specific embodiments of the invention. In this example, received signals are input to the first and second tuners 110a and 110b but any number of tuners can be used in receiver 1. Tuners 110a and 110b are tunable on the same or different channels of the satellite television broadcast network for simultaneous reception. of the same or different television programs and/or media items. Signals from the first and second tuners 110a and 110b are passed to a crossbar switch 111 which separates data received from the first and second tuners 10a and 10b into data for direct broadcast to a television, data representing received television programs for recording and subsequent replay, and user services and program programming data, in accordance with the XSI standard, for example. The receiver 1 has a hard disk (or other storage medium) 113 which receives from the crossbar switch 111 compressed video and/or audio data for recording and subsequent repetition via the recording and repetition circuitry 116. In the embodiment illustrated in Figure 15, the receiver 1 includes two demlitplexor recording pipes (DMRec1 and DMRec2), which are coupled to random access streaming protocol (RASP) circuitry for analyzing data in a received stream and indexing the data as it is received. Recording and replay circuitry 116 is also configured to perform decryption of received data, for example, before video and audio data is transmitted for replay on a display, using decryption keys stored in accordance with the encryption technique used to encrypt the received data.
The received signals comprise digitally encoded data. In this example, the data is compressed using the H.264 or Digital Video Broadcast/Moving Pictures Expert Group 2 or 4 (DVB/MPEG 2/4) standard which allows for both program data and additional data (eg metadata and/or or relation data) are transmitted on a single channel. Hard disk 113 receives and stores compressed data. Data is decompressed only after hard disk recovery 113.
Satellite (and actually cable) programs are usually mixed to limit access to authorized users, eg subscribers. Receiver 1 therefore has an Integrated Conditional Access Module (ICAM) 114 which cooperates with a smart card 114a to determine whether the viewer has subscribed to a specific channel and is therefore authorized to access the channel. Parental control over channel access is also provided, at least in part, by access control circuitry 114. Receiver 1 further comprises a demultiplex and separate circuit 115 which receives data from a selector 117 from crossbar switch 111 for direct output or data from hard disk 113 for replay. Demultiplex and separate circuit 115 separates the data into video data and audio data for distribution to various locations in receiver 1. Demultiplex and separate circuit 116 is also controlled by access control circuit 114 to enable signal separation by authorized subscribers. The receiver 1 also comprises a video decoder 118 for decompressing and processing encoded video data received from the demultiplexing and separating circuit 115, and an audio decoder 119 for decompressing and processing compressed audio data, operating in accordance with the MPEG standard. 2/4, for example.
Uncompressed video data is provided to standard definition display circuitry 120 and/or high definition display circuitry 121 which combines the uncompressed video data with corresponding standard definition or high definition screen display and generated graphics. on-screen display and graphic generation circuitry 122 utilizing user services and program programming data. Standard definition display circuitry 120 provides the combined standard definition graphics and video data to a standard definition digital encoder and Digital to Analog Converters (DACs) 124 where the data is encoded and converted into a suitable format for direct input into a television set. The high definition display circuitry 121 provides the high definition graphics and video data combined with a high definition digital encoder and digital to analog converter (DAC) 125 where the data is encoded in an appropriate high definition format. for broadcast to a high definition TV if so desired. The combined high definition video and graphic data is also provided to a High Definition Multimedia Interface (HDMI) 126 interface which also receives uncompressed audio data from the audio decoder 119 through the post-processing circuitry. 127 audio processing, for output to an HDMI input of a high definition TV if so desired. Uncompressed and processed audio data is also fed to an audio DAC 131 for direct input to an analog audio device or speakers. Demultiplex and separate circuit 115 can also output compressed digital audio to a proprietary audio interface 133, for example, in accordance with the Sony/Philips Digital Interconnect (SPDIF) format, for direct input to appropriate audio equipment.
Receiver 1 is controlled by a processor 123 which communicates with the various receiver units via a bus (not shown). Processor 123 has associated with it Random Access Memory (RAM) 134. Processor 123 controls the operation of receiver 1 by tuning tuners 110a and 110b to receive signals for the desired channels by controlling demultiplexing, separation and decompression so that the desired interactive program and/or service data is displayed on the TV screen, and by controlling the hard disk 113 to record desired television programs or repeat previously recorded television programs. The selection of viewers of desired programs and customer services is controlled by viewer manipulation of a remote control unit 128, which in response to such manipulation by the viewer transmits control signals to an input receiver 129 for input to processor 123. remote control unit 128 also allows the viewer to control the operation of hard disk 13 to record television programs, repeat recorded television programs and schedule recording of television programs, etc.
Operation of receiver 1 is controlled by software which makes processor 123 responsive to control signals from remote control unit 128 and/or additional data in the received signals. The interaction between hardware and software in receiver 1 may include functionality as described in detail in the applicant's earlier international patent application published as WO 01/11865. The operation of receiver 1 in receiving and decoding data representing television programs and data defining programming and other program-related information may include functionality as described in applicant's earlier international patent application published as WO 96/37996. The operation of receiver 1 in providing interactive services may include functionality as described in applicant's earlier international patent application published as WO 97/23997.
In the Digital Video broadcasting (DVB) standard for digital television broadcasting there is a standard for broadcasting relationship information in such a way that it can be decoded and correctly presented to subscribers in the form of an Electronic Program Guide (EPG). This DVB standard is known generically as the SI standard and can be found in the specification: ETS 300 468, ETSI Digital Broadcasting Systems for Television, Sound and data services; Specification for Service Information (SI) in Digital Video broadcasting (DVB) systems 2nd edition. Guidelines for using the specification are provided in ETSI ETR 211 - DVB SI Guidelines. Receiver 1 is preferably designed to support the SI specification.
In addition to operating data for use in controlling access to channels, additional data on a channel may include summary program relation data representative of so-called event information tables (EITs) defining the schedule of programs on each channel. The program relation data can be stored in RAM 134 and, after storage, the programming information is effectively available instantly. Alternatively, the program relationship data can be stored on the hard disk 113. The program relationship data is regularly transmitted so that the receiver 1 is updated substantially continuously. As those skilled in the art will recognize, the information transmitted can be summarized to allow each channel to contain a reduced set of program relationship data without excessive overhead in terms of bandwidth requirements on each channel and memory requirements at the receiver.
In addition, a dedicated EPG channel transmits more detailed program scheduling information, such as program synopsis or other auxiliary data associated with scheduled programs, which is stored on hard disk 113. Receiver 1 is arranged to display the program scheduling information to several of the channels in a predetermined period of time on the TV. Furthermore, a viewer can interact with receiver 1 to schedule recordings of television programs, view a desired part of the available program list, etc., based on information received via the dedicated EPG channel.
Since tuners 10a and 10b can be tuned to receive different channels, it is possible for a first television program on one channel to be displayed on one TV and recorded on hard disk 13, while at the same time a second television program on another channel is also recorded on hard disk 13. The operation of receiver 1 in providing simultaneous recording and replay may be as described in applicant's earlier international patent application published as WO 01/11864. The hard disk 113 of receiver 1 can be similar to conventional hard disks used in computer systems to store large amounts of data. Hard disk 113 can have a capacity of many gigabytes (for example, 400 gigabytes or more) and receive video and audio data through a SATA interface, for example, for storage in the compressed form in which it is received, for example, according to with DVB/MPEG 2 standards as discussed above. This allows storage of several hours of television programs (eg 100+ hours) on hard disk 113. Hard disk 113 may comprise two or more storage areas, one for storing television program data, and the other for storage of metadata and/or recorded media items. Processor 23 controls the recording and repetition of television programs to and from hard disk 113. Other processors (not shown) can be used to control hard disk 113 as appropriate. Receiver 1 also includes an external 135 interface, such as a Universal Serial Bus 2 (USB2) port. The USB2 interface can be connected to a transcoding device (not shown) via a USB connector, which allows media content in a first format to be provided from receiver 1 and transcoded by the transcoding device connected to a second format. media encoding suitable for replay on a personal media player (not shown). The operation of receiver 1 in providing transcoding services can be as described in applicant's earlier international patent application published as WO 06/125999. computer system
Entities described herein, such as the scheduling function 8 and/or the profile management function, can be implemented by computer systems such as computer system 200 as shown in Figure 16. Embodiments of the present invention can be implemented as programmable code for execution by such computer systems 200. After reading this description, it will become apparent to a person skilled in the art how to implement the invention using other computer systems and/or computer architectures.
Computer system 200 includes one or more processors, such as processor 204. Processor 204 can be any type of processor, including, but not limited to, a special-purpose or general-purpose digital signal processor. Processor 204 is connected to a communication infrastructure 206 (eg, a bus or network). Several software implementations are described in terms of this exemplary computer system. After reading this description, it will become apparent to a person skilled in the art how to implement the invention using other computer systems and/or computer architectures.
Computer system 200 also includes main memory 208, preferably random access memory (RAM), and may also include secondary memory 610. Secondary memory 210 may include, for example, a hard disk drive 212 and/or removable storage unit 214 representing a floppy disk drive, a magnetic tape drive, an optical disk drive, etc. removable storage unit 214 reads from and/or writes to removable storage unit 218 in a well-known manner. Removable storage unit 218 represents a floppy disk, magnetic tape, optical disk, etc., which is read by and written to by removable storage unit 214. As will be recognized, removable storage unit 618 includes a storage medium usable by computer having stored in the same computer software and/or data.
In alternative implementations, secondary memory 210 may include other similar means for allowing computer programs or other instructions to be loaded into computer system 200. Such means may include, for example, a removable storage unit 222 and an interface 220. examples of such media may include a program cartridge and cartridge interface (such as that previously found in video game devices), a removable memory chip (such as an EPROM, or PROM or flash memory) and associated socket, and other storage units removable storage unit 222 and interfaces 220 which allow software and data to be transferred from removable storage unit 222 to computer system 200. Alternatively, the program can be executed and/or data accessed from removable storage unit 222 using processor 204 of the 200 computer system.
Computer system 200 may also include a communication interface 224. Communication interface 224 allows software and data to be transferred between computer system 200 and external devices. Examples of communication interface 224 may include a modem, a network interface (such as an Ethernet card), a communication port, a Personal Computer Memory Card International Association (PCMCIA) partition and card, etc. software and data transferred via communication interface 224 are in the form of signals 228, which may be electronic, electromagnetic, optical or other signals capable of being received by communication interface 224. These signals 228 are provided to communication interface 224 via of a communication path 226. The communication path 226 contains signals 228 and may be implemented using wire or cable, fiber optics, a telephone line, a wireless link, a cellular phone link, a radio frequency link, or any other appropriate communication channel. For example, communication path 226 can be implemented using a combination of channels.
The terms "computer program media" and "computer readable media" are used generically to refer to media such as removable storage unit 214, a hard disk installed in hard disk drive 212, and signs 228. These program products Computers are means to provide software for the computer system 200. However, these terms can also include signals (such as electrical, optical, or electromagnetic signals) that embody the computer program disclosed here.
Computer programs (also called computer control logic) are stored in main memory 208 and/or secondary memory 210. Computer programs can also be received through communication interface 224. Such computer programs, when executed, allow the computer system 200 implements embodiments of the present invention as discussed herein. Therefore, such computer programs represent computer system controllers 200. Where the embodiment is implemented using software, the software can be stored in a computer program product and loaded in computer system 200 using removable storage unit 214, hard disk drive 212, or communication interface 224, to provide some examples.
Alternative modalities can be implemented as control logic in hardware, firmware, or software or any combination thereof. Alternative Modalities
The above modality is described with reference to a broadcast system, such as a satellite, cable or Internet broadcast system. Aspects of the invention are also applicable to a video on demand (VOD) or push video on demand (PVOD) system, in which a program is received and/or displayed on demand, and includes one or more replacement partitions as part. from the program. The replacement system can be applied to the replacement system in a manner similar to the broadcast system described above.
The above embodiment is described with reference to replacement advertising, however aspects of the invention do not depend on the content or commercial nature of advertising. Replacement systems as described above are applicable to other media types having other limitation and/or optimization rules. For example, aspects of the invention are applicable to the distribution of programs with replacement segments, for example, to allow display of alternative content depending on the profile data in the receiver. In that case, there may be capping rules that limit which combination of segments can be issued. In another example, aspects of the invention are applicable to system or public service advertisements targeted to specific user profiles.
The above modality reveals a video broadcast system in which broadcast programs and replacement media content comprise video, and associated audio where applicable. However, aspects of the invention are applicable to audio-only content, such as digital radio broadcasts, or a mixture of audio-only content and video; for example, broadcast programs can be video programs, and the replacement media content can comprise audio-only content that is output through a still image generated locally in the receiver.
The above mode reveals a time-split system in which insertable media items are output during breaks in or between programs. However, partitions for insertable media items can be time-concurrent with programs; for example, replacement content can be superimposed on a program display, or be added to or replace the audio broadcast, for example, for dubbing.
Replacement media items are described in the specific embodiments above as comprising audio and/or video clips, but may alternatively or additionally comprise data and/or instructions which when executed by receiver 1 cause audio and/or video content is issued; for example, video items can be defined as 2D or 3D graphic objects, and audio items can be defined as musical instructions, such as MIDI files or speech synthesis codes.
Alternative modalities can be imagined, which nevertheless are with
within the scope of the following claims.

权利要求:
Claims (10)
[0001]
1. Method of selecting a plurality of media items, each for transmission by a program receiver (1), in a corresponding partition of a plurality of partitions in a program interrupt, the method being FEATURED to comprise, in the receiver (1): a. receiving from a central scheduling function (8), for each of the partitions, a corresponding list (LL) of one or more possible media items programmed for broadcast in said partition; B. determining, from each list (LL), one or more of the possible media items (SL) that are available in local storage in the program receiver (1); and c. select (P3), for each of the partitions, from the one or more possible media items of the corresponding list (LL) that are available in local storage, to a media item to be issued in that partition solving one or more limitations associated with one or more media items selected for broadcast on at least one other of the partitions within the interrupt.
[0002]
2. Method according to claim 1, CHARACTERIZED by the fact that the receiver (1) records in local storage possible media items that match profile data associated with the receiver (1).
[0003]
3. Method according to claim 2, CHARACTERIZED by the fact that the possible media items are previously received through a broadcast channel.
[0004]
4. Method according to claim 1, CHARACTERIZED by further comprising receiving one or more unscheduled media items not allocated to a specific partition among the partitions, and selecting one of the unscheduled media items to issue in one of the partitions.
[0005]
5. Method according to claim 4, CHARACTERIZED by the fact that the unscheduled media item is selected for issuance in the partition in accordance with one or more limitations associated with one or more media items scheduled for issuance in at least another partition of program.
[0006]
6. Method according to any one of claims 1 to 5, CHARACTERIZED by the fact that one of the possible media items is selected for output to the partition based on priority data associated with at least some of the possible scheduled media items for issuance in that partition.
[0007]
7. Method according to any one of claims 1 to 6, CHARACTERIZED by the fact that up to one of the possible media items is selected for issuance based on previous issuance of at least one of the possible media items by the receiver (1) .
[0008]
8. Method according to any one of claims 1 to 7, CHARACTERIZED by the fact that one of the media items is selected for issuance in the partition because it meets one or more limitations associated with that partition.
[0009]
9. Method according to any one of claims 1 to 8, CHARACTERIZED by the fact that possible media items include a linear media item 5 included in a program stream.
[0010]
10. Method according to any one of claims 1 to 9, CHARACTERIZED by the fact that the list of one or more possible media items is received through a broadcast channel.

类似技术:

---

公开号 | 公开日 | 专利标题

---

US11006174B2|2021-05-11|Media insertion system

---

AU2016200956B2|2018-04-05|Media insertion system

---

BR122013019793B1|2021-11-16|MEDIA INSERTION METHOD

---

AU2014200918B2|2016-06-30|Media insertion system

同族专利:

---

公开号 | 公开日

---

AU2010277397B2|2015-09-17|

---

CY1120986T1|2019-12-11|

---

GB201004738D0|2010-05-05|

---

CN102550036A|2012-07-04|

---

GB2516788A|2015-02-04|

---

EP3249917A1|2017-11-29|

---

WO2011012909A3|2011-04-14|

---

CN105430428A|2016-03-23|

---

US10798445B2|2020-10-06|

---

GB2516789A|2015-02-04|

---

NZ716531A|2016-05-27|

---

NZ617593A|2015-05-29|

---

GB2472264A|2011-02-02|

---

GB201501023D0|2015-03-04|

---

CN105488700A|2016-04-13|

---

US20120311649A1|2012-12-06|

---

US20200236420A1|2020-07-23|

---

GB201419887D0|2014-12-24|

---

WO2011012909A2|2011-02-03|

---

EP3244627A1|2017-11-15|

---

PT2460352T|2018-03-23|

---

DK3244627T3|2019-01-21|

---

IL242625A|2016-05-31|

---

GB2516386A|2015-01-21|

---

CA2769688A1|2011-02-03|

---

EP3249916A1|2017-11-29|

---

AU2010277397A1|2012-03-08|

---

GB0913389D0|2009-09-16|

---

IL242626A|2016-05-31|

---

HK1247762A1|2018-09-28|

---

US20170332133A1|2017-11-16|

---

CN105430428B|2019-03-01|

---

GB201418716D0|2014-12-03|

---

GB2472264B|2014-12-17|

---

GB201419886D0|2014-12-24|

---

GB201003034D0|2010-04-07|

---

EP2460352A2|2012-06-06|

---

BR122013019793A2|2019-08-06|

---

EP3244627B1|2018-09-26|

---

GB2518792A|2015-04-01|

---

NZ704055A|2016-05-27|

---

CY1120218T1|2018-12-12|

---

US20170302975A1|2017-10-19|

---

GB2516789B|2015-05-13|

---

GB2516386B|2015-03-18|

---

GB2484877A|2012-04-25|

---

NO2460352T3|2018-05-19|

---

BR112012006884A2|2017-10-10|

---

PL3244627T3|2019-03-29|

---

EP2460352B1|2017-12-20|

---

HUE041812T2|2019-06-28|

---

NZ598332A|2014-01-31|

---

US10667006B2|2020-05-26|

---

GB2516790A|2015-02-04|

---

EP3249915A1|2017-11-29|

---

LT3244627T|2019-01-10|

---

PT3244627T|2018-12-28|

---

EP3249918A1|2017-11-29|

---

BR122013019795A2|2019-08-06|

---

GB2516790B|2015-05-13|

---

US10602217B2|2020-03-24|

---

GB2520453A|2015-05-20|

---

GB2473306B|2014-12-17|

---

ES2663281T3|2018-04-11|

---

GB201419889D0|2014-12-24|

---

IL242627A|2016-05-31|

---

MX2012001405A|2012-04-20|

---

CN105488700B|2020-02-18|

---

GB201008787D0|2010-07-14|

---

CA2769688C|2018-10-16|

---

SI2460352T1|2018-04-30|

---

IL242624A|2016-05-31|

---

GB201203328D0|2012-04-11|

---

GB201503601D0|2015-04-15|

---

LT2460352T|2018-04-10|

---

HUE037276T2|2018-08-28|

---

US20200413124A1|2020-12-31|

---

US11006174B2|2021-05-11|

---

GB2520453B|2015-07-01|

---

CN105681824A|2016-06-15|

---

DK2460352T3|2018-04-09|

---

SI3244627T1|2019-02-28|

---

US20170332048A1|2017-11-16|

---

GB2473306A|2011-03-09|

---

GB2484877B|2014-12-31|

---

CN102550036B|2016-02-03|

---

US10149006B2|2018-12-04|

---

HRP20182117T1|2019-02-08|

---

ES2703213T3|2019-03-07|

---

HRP20180449T1|2018-06-01|

---

IL240570A|2016-03-31|

---

IL217819D0|2012-03-29|

---

HK1247763A1|2018-09-28|

---

PL2460352T3|2018-06-29|

---

GB2516788B|2015-04-15|

---

GB2518792B|2015-05-13|

---

IL240570D0|2015-09-24|

引用文献:

---

公开号 | 申请日 | 公开日 | 申请人 | 专利标题

---

---

US5446919A|1990-02-20|1995-08-29|Wilkins; Jeff K.|Communication system and method with demographically or psychographically defined audiences|

---

IT1268195B1|1994-12-23|1997-02-21|Sip|DECODER FOR AUDIO SIGNALS BELONGING TO COMPRESSED AND CODED AUDIO-VISUAL SEQUENCES.|

---

EP2265022A3|1995-12-22|2011-01-19|British Sky Broadcasting Limited|Improvements In Receivers For Television Signals|

---

GB9526304D0|1995-05-22|1996-02-21|British Sky Broadcasting Ltd|Interactive services interface|

---

AU7606696A|1995-11-07|1997-05-29|Seiko Communications Systems, Inc.|Selective advertisement presentation|

---

EP1208696B1|1999-08-09|2006-01-25|British Sky Broadcasting Limited|Broadcast program recording apparatus using electronic program guide|

---

US7096487B1|1999-10-27|2006-08-22|Sedna Patent Services, Llc|Apparatus and method for combining realtime and non-realtime encoded content|

---

AU2001229652A1|2000-01-19|2003-06-30|Next Century Media|System and method for providing individualized targeted electronic advertising over a digital broadcast medium|

---

US7028071B1|2000-01-28|2006-04-11|Bycast Inc.|Content distribution system for generating content streams to suit different users and facilitating e-commerce transactions using broadcast content metadata|

---

WO2002030112A1|2000-10-05|2002-04-11|Expanse Networks, Inc.|Targeting ads in ipgs, live programming and recorded programming, and coordinating the ads therebetween|

---

US20050283796A1|2000-02-18|2005-12-22|Prime Research Alliance E., Inc.|Method and system for addressable and program independent advertising during recorded programs|

---

US8006261B1|2000-04-07|2011-08-23|Visible World, Inc.|System and method for personalized message creation and delivery|

---

GB0012211D0|2000-05-19|2000-07-12|Gemstar Dev Limited|A targeted advertising system|

---

US7328448B2|2000-08-31|2008-02-05|Prime Research Alliance E, Inc.|Advertisement distribution system for distributing targeted advertisements in television systems|

---

US6909837B1|2000-11-13|2005-06-21|Sony Corporation|Method and system for providing alternative, less-intrusive advertising that appears during fast forward playback of a recorded video program|

---

US8290351B2|2001-04-03|2012-10-16|Prime Research Alliance E., Inc.|Alternative advertising in prerecorded media|

---

US20020147990A1|2001-04-10|2002-10-10|Koninklijke Philips Electronics N.V.|System and method for inserting video and audio packets into a video transport stream|

---

US7327931B2|2001-05-22|2008-02-05|Texas Instruments Incorporated|Alternate method of showing commercials using personal video recorders|

---

US7266832B2|2001-06-14|2007-09-04|Digeo, Inc.|Advertisement swapping using an aggregator for an interactive television system|

---

KR20030014020A|2001-08-10|2003-02-15|한국전자통신연구원|A wavelength converting apparatus using optical source having fixed wavelength and an optical cross connecting system adapting thereof|

---

US20030058707A1|2001-09-12|2003-03-27|Dilger Bruce C.|System and process for implementing commercial breaks in programming|

---

JP4534168B2|2001-09-27|2010-09-01|ソニー株式会社|Information processing apparatus and method, recording medium, and program|

---

US7274862B2|2001-09-27|2007-09-25|Sony Corporation|Information processing apparatus|

---

US20030149975A1|2002-02-05|2003-08-07|Charles Eldering|Targeted advertising in on demand programming|

---

US20030154128A1|2002-02-11|2003-08-14|Liga Kevin M.|Communicating and displaying an advertisement using a personal video recorder|

---

CN1372220A|2002-03-14|2002-10-02|王宝成|Personal information network media interactive advertisement system|

---

US20040098743A1|2002-11-15|2004-05-20|Koninklijke Philips Electronics N.V.|Prediction of ratings for shows not yet shown|

---

US7716700B2|2002-11-25|2010-05-11|Time Warner Interactive Video Group Inc.|Technique for delivering entertainment programming content including commercial content therein over a communications network|

---

WO2005025227A1|2003-09-05|2005-03-17|General Instrument Corporation|Methods and apparatus to improve the rate control during splice transitions|

---

US8156444B1|2003-12-31|2012-04-10|Google Inc.|Systems and methods for determining a user interface attribute|

---

WO2005076961A2|2004-02-04|2005-08-25|Goldpocket Interactive|Synchronization and automation in an itv environment|

---

JP4995713B2|2004-03-09|2012-08-08|ビー． シラー，ジェイ|Digital ad insertion for video on demand|

---

CN100553330C|2004-05-31|2009-10-21|松下电器产业株式会社|Digit broadcasting system and digital broadcast transmitting and method of reseptance|

---

US20060013556A1|2004-07-01|2006-01-19|Thomas Poslinski|Commercial information and guide|

---

CN101167130B|2005-03-22|2013-03-13|松下电器产业株式会社|Stream data recording device, stream data recording/reproducing device, stream data reproduction device, stream data editing device, stream recording method, and stream reproducing method|

---

GB2426623B|2005-05-23|2011-01-26|British Sky Broadcasting Ltd|Apparatus for media recording and playback|

---

GB2426651A|2005-05-25|2006-11-29|British Sky Broadcasting Ltd|Media transcoding device|

---

US20080046924A1|2006-07-28|2008-02-21|Tandberg Television Inc.|System and methods for competitive dynamic selection of digital advertising assets in a video distribution system|

---

WO2008025578A1|2006-08-31|2008-03-06|International Business Machines Corporation|Personalized advertising in mobile television|

---

US20080127246A1|2006-09-14|2008-05-29|Nortel Networks Limited|Digital media recorder based advertising|

---

CN101523911B|2006-10-31|2013-08-28|Tivo有限公司|Method and apparatus for downloading ancillary program data to dvr|

---

US20080152300A1|2006-12-22|2008-06-26|Guideworks, Llc|Systems and methods for inserting advertisements during commercial skip|

---

GB2444973A|2006-12-22|2008-06-25|British Sky Broadcasting Ltd|Media demand and playback system|

---

US20080114861A1|2007-01-05|2008-05-15|Gildred John T|Method of inserting promotional content within downloaded video content|

---

US20080260352A1|2007-04-19|2008-10-23|Gary Turner|Recorded advertisement enhancement|

---

US7934230B2|2007-05-04|2011-04-26|Alcatel Lucent|IPTV architecture for dynamic commercial insertion|

---

GB2451518B|2007-08-03|2010-09-01|Sony Service Ct|Multicast television system|

---

US20090094093A1|2007-10-05|2009-04-09|Yahoo! Inc.|System for selecting advertisements|

---

US8997142B2|2009-03-24|2015-03-31|Microsoft Technology Licensing, Llc|Advertisement insertion decisions for set top box management of advertisements|

---

US20100280876A1|2009-04-30|2010-11-04|Microsoft Corporation|Implicit rating of advertisements|

---

US8774609B2|2009-05-18|2014-07-08|Disney Enterprises, Inc.|System and method for providing time-adapted video content|

---

US9521437B2|2009-06-17|2016-12-13|Google Technology Holdings LLC|Insertion of recorded secondary digital video content during playback of primary digital video content|

---

GB2472264B|2009-07-31|2014-12-17|British Sky Broadcasting Ltd|Media substitution system|US8745670B2|2008-02-26|2014-06-03|At&T Intellectual Property I, Lp|System and method for promoting marketable items|

---

GB2472264B|2009-07-31|2014-12-17|British Sky Broadcasting Ltd|Media substitution system|

---

US9301020B2|2010-11-30|2016-03-29|Google Technology Holdings LLC|Method of targeted ad insertion using HTTP live streaming protocol|

---

US9792363B2|2011-02-01|2017-10-17|Vdopia, INC.|Video display method|

---

US9860293B2|2011-03-16|2018-01-02|Electronics And Telecommunications Research Institute|Apparatus and method for providing streaming content using representations|

---

EP2689580A4|2011-03-23|2014-10-29|Invidi Tech Corp|A priori scheduling of multiple assets within a collection of asset delivery opportunities|

---

US10108980B2|2011-06-24|2018-10-23|At&T Intellectual Property I, L.P.|Method and apparatus for targeted advertising|

---

US10423968B2|2011-06-30|2019-09-24|At&T Intellectual Property I, L.P.|Method and apparatus for marketability assessment|

---

US9877054B2|2012-02-22|2018-01-23|Imagine Communications Corp.|Dynamic scheduling for advanced advertising in linear television|

---

US9609395B2|2012-03-26|2017-03-28|Max Abecassis|Second screen subtitles function|

---

US9124950B2|2012-03-26|2015-09-01|Max Abecassis|Providing item information notification during video playing|

---

US9380282B2|2012-03-26|2016-06-28|Max Abecassis|Providing item information during video playing|

---

CN103458271A|2012-05-29|2013-12-18|北京数码视讯科技股份有限公司|Audio-video file splicing method and audio-video file splicing device|

---

US9106965B2|2012-12-27|2015-08-11|Echostar Technologies L.L.C.|Using idle resources to reduce channel change times|

---

US9407954B2|2013-10-23|2016-08-02|At&T Intellectual Property I, Lp|Method and apparatus for promotional programming|

---

CN103747341B|2013-12-31|2017-04-12|四川迪佳通电子有限公司|Television program attribute updating method and television program attribute updating device|

---

JP6438040B2|2014-02-10|2018-12-12|ドルビー・インターナショナル・アーベー|Embed encoded audio in transport streams for perfect splicing|

---

US9936242B2|2014-02-25|2018-04-03|Google Llc|Merging content channels|

---

GB2528039A|2014-07-01|2016-01-13|Canon Kk|Method for identifying objects across time periods and corresponding device|

---

US9854306B2|2014-07-28|2017-12-26|Echostar Technologies L.L.C.|Methods and systems for content navigation among programs presenting advertising content|

---

US9756378B2|2015-01-07|2017-09-05|Echostar Technologies L.L.C.|Single file PVR per service ID|

---

MX371467B|2015-03-02|2020-01-29|Nec Corp|Decoding device, reception device, transmission device, transmission/reception system, decoding method, and storage medium having decoding program stored therein.|

---

CN108140155A|2015-05-13|2018-06-08|艾博渡沙班摩迪公司|For the system and method for the Workflow Management in isolation environment|

---

US9635413B2|2015-09-23|2017-04-25|Echostar Technologies L.L.C.|Advance decryption key acquisition for streaming media content|

---

US9596502B1|2015-12-21|2017-03-14|Max Abecassis|Integration of multiple synchronization methodologies|

---

US9516373B1|2015-12-21|2016-12-06|Max Abecassis|Presets of synchronized second screen functions|

---

EP3185564A1|2015-12-22|2017-06-28|Harmonic Inc.|Video stream splicing of groups of pictures |

---

CN106210805B|2016-08-15|2019-04-02|李世平|A kind of control method and system for realizing broadcasting content safety using set-top box|

---

US10693642B1|2017-06-05|2020-06-23|Amazon Technologies, Inc.|Output switching for encoded content streams|

---

CN109996012A|2019-03-29|2019-07-09|上海晨驭信息科技有限公司|A kind of collection fraction splicing recording and broadcasting system|

法律状态:
2019-01-15| B06F| Objections, documents and/or translations needed after an examination request according [chapter 6.6 patent gazette]|

---

2019-12-17| B15K| Others concerning applications: alteration of classification|Free format text: AS CLASSIFICACOES ANTERIORES ERAM: H04N 7/16 , G06Q 30/00 , H04N 7/24 Ipc: H04N 21/234 (2011.01), G06Q 30/02 (2012.01), H04N |

---

2019-12-24| B06U| Preliminary requirement: requests with searches performed by other patent offices: procedure suspended [chapter 6.21 patent gazette]|

---

2021-06-08| B09A| Decision: intention to grant [chapter 9.1 patent gazette]|

---

2021-07-06| B16A| Patent or certificate of addition of invention granted [chapter 16.1 patent gazette]|Free format text: PRAZO DE VALIDADE: 20 (VINTE) ANOS CONTADOS A PARTIR DE 02/08/2010, OBSERVADAS AS CONDICOES LEGAIS. PATENTE CONCEDIDA CONFORME ADI 5.529/DF, QUE DETERMINA A ALTERACAO DO PRAZO DE CONCESSAO. |

优先权:

---

申请号 | 申请日 | 专利标题

---

GB0913389.3A|GB2472264B|2009-07-31|2009-07-31|Media substitution system|

---

GB0913389.3|2009-07-31|

---

GB1003034.4|2010-02-23|

---

GBGB1003034.4A|GB201003034D0|2009-07-31|2010-02-23|Media substitution system|

---

GB1004738.9A|GB2473306B|2009-07-31|2010-03-22|Media substitution system|

---

GB1004738.9|2010-03-22|

---

GB1008787.2|2010-05-26|

---

GBGB1008787.2A|GB201008787D0|2009-07-31|2010-05-26|Media Substitution system|

---

PCT/GB2010/051274|WO2011012909A2|2009-07-31|2010-08-02|Media insertion system|BR122013019795-8A| BR122013019795A2|2009-07-31|2010-08-02|MEDIA INSERTION SYSTEM|

---

BR122013019793-1A| BR122013019793B1|2009-07-31|2010-08-02|MEDIA INSERTION METHOD|